./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-mts.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:09:10,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:09:10,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:09:10,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:09:10,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:09:10,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:09:10,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:09:10,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:09:10,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:09:10,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:09:10,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:09:10,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:09:10,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:09:10,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:09:10,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:10,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:09:10,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:09:10,770 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2025-02-06 13:09:10,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:09:11,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:09:11,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:09:11,005 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:09:11,006 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:09:11,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-02-06 13:09:12,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/256b3de10/7dd1d22abda3454e8467c40f9a4003eb/FLAGb51c6b0b9 [2025-02-06 13:09:12,628 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:09:12,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-02-06 13:09:12,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/256b3de10/7dd1d22abda3454e8467c40f9a4003eb/FLAGb51c6b0b9 [2025-02-06 13:09:12,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/256b3de10/7dd1d22abda3454e8467c40f9a4003eb [2025-02-06 13:09:12,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:09:12,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:09:12,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:12,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:09:12,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:09:12,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71dff885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12, skipping insertion in model container [2025-02-06 13:09:12,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:09:12,845 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:09:12,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:12,861 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:09:12,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:12,903 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:09:12,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12 WrapperNode [2025-02-06 13:09:12,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:12,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:12,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:09:12,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:09:12,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,950 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 206 [2025-02-06 13:09:12,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:12,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:09:12,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:09:12,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:09:12,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,982 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 13:09:12,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:12,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:13,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:09:13,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:09:13,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:09:13,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:09:13,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (1/1) ... [2025-02-06 13:09:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:13,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:13,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:09:13,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:09:13,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:09:13,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:09:13,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:09:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:09:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:09:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:09:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:09:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:09:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:09:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:09:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:09:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:09:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:09:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:09:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:09:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:09:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:09:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:09:13,067 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:09:13,168 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:09:13,170 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:09:13,497 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:09:13,497 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:09:13,744 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:09:13,744 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:09:13,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:13 BoogieIcfgContainer [2025-02-06 13:09:13,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:09:13,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:09:13,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:09:13,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:09:13,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:09:12" (1/3) ... [2025-02-06 13:09:13,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c306f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:13, skipping insertion in model container [2025-02-06 13:09:13,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:12" (2/3) ... [2025-02-06 13:09:13,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c306f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:13, skipping insertion in model container [2025-02-06 13:09:13,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:13" (3/3) ... [2025-02-06 13:09:13,752 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-02-06 13:09:13,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:09:13,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-02-06 13:09:13,766 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:09:13,830 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:09:13,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 58 transitions, 137 flow [2025-02-06 13:09:13,891 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2025-02-06 13:09:13,892 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:09:13,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 6/55 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 158 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-02-06 13:09:13,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 58 transitions, 137 flow [2025-02-06 13:09:13,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 54 transitions, 126 flow [2025-02-06 13:09:13,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:09:13,920 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;@3fca37af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:09:13,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-06 13:09:13,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:09:13,925 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:09:13,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:09:13,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:13,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:13,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash 632347, now seen corresponding path program 1 times [2025-02-06 13:09:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:13,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479928945] [2025-02-06 13:09:13,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:13,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:13,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:14,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:14,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:14,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479928945] [2025-02-06 13:09:14,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479928945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:09:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169523792] [2025-02-06 13:09:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:14,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:14,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:14,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:14,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:14,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:14,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:14,486 INFO L124 PetriNetUnfolderBase]: 1076/1549 cut-off events. [2025-02-06 13:09:14,486 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-02-06 13:09:14,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3130 conditions, 1549 events. 1076/1549 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6467 event pairs, 723 based on Foata normal form. 1/1405 useless extension candidates. Maximal degree in co-relation 2854. Up to 1475 conditions per place. [2025-02-06 13:09:14,505 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 30 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-02-06 13:09:14,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 176 flow [2025-02-06 13:09:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-06 13:09:14,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2025-02-06 13:09:14,519 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 126 flow. Second operand 3 states and 95 transitions. [2025-02-06 13:09:14,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 176 flow [2025-02-06 13:09:14,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:09:14,528 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 104 flow [2025-02-06 13:09:14,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-02-06 13:09:14,532 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2025-02-06 13:09:14,532 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 104 flow [2025-02-06 13:09:14,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:14,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:14,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:14,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:09:14,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:14,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 632348, now seen corresponding path program 1 times [2025-02-06 13:09:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516684812] [2025-02-06 13:09:14,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:14,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:14,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:14,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:14,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516684812] [2025-02-06 13:09:14,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516684812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:14,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173194691] [2025-02-06 13:09:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:14,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:14,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:14,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:14,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:14,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:14,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:14,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:14,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:14,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:15,123 INFO L124 PetriNetUnfolderBase]: 1077/1552 cut-off events. [2025-02-06 13:09:15,123 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 13:09:15,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 1552 events. 1077/1552 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6464 event pairs, 723 based on Foata normal form. 0/1407 useless extension candidates. Maximal degree in co-relation 3048. Up to 1480 conditions per place. [2025-02-06 13:09:15,132 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 32 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-02-06 13:09:15,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 184 flow [2025-02-06 13:09:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-02-06 13:09:15,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2025-02-06 13:09:15,133 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 104 flow. Second operand 4 states and 113 transitions. [2025-02-06 13:09:15,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 184 flow [2025-02-06 13:09:15,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:15,135 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 127 flow [2025-02-06 13:09:15,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2025-02-06 13:09:15,136 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2025-02-06 13:09:15,136 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 127 flow [2025-02-06 13:09:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:15,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:15,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:09:15,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:09:15,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 607706619, now seen corresponding path program 1 times [2025-02-06 13:09:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259009766] [2025-02-06 13:09:15,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:15,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:15,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:15,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:15,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259009766] [2025-02-06 13:09:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259009766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739140833] [2025-02-06 13:09:15,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:15,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:15,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:15,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:09:15,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:15,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:15,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:15,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:15,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:09:15,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:15,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 13:09:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:15,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739140833] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:15,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:15,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:09:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438943337] [2025-02-06 13:09:15,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:15,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:09:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:15,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:09:15,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:09:15,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:15,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 127 flow. Second operand has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:15,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:15,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:15,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:16,278 INFO L124 PetriNetUnfolderBase]: 1078/1554 cut-off events. [2025-02-06 13:09:16,279 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 13:09:16,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 1554 events. 1078/1554 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6475 event pairs, 723 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 3055. Up to 1477 conditions per place. [2025-02-06 13:09:16,289 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 28 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2025-02-06 13:09:16,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 211 flow [2025-02-06 13:09:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-02-06 13:09:16,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2025-02-06 13:09:16,291 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 127 flow. Second operand 8 states and 192 transitions. [2025-02-06 13:09:16,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 211 flow [2025-02-06 13:09:16,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:09:16,292 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 152 flow [2025-02-06 13:09:16,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-02-06 13:09:16,293 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-02-06 13:09:16,293 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 152 flow [2025-02-06 13:09:16,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:16,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:16,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:09:16,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:09:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:16,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1661832090, now seen corresponding path program 1 times [2025-02-06 13:09:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269050082] [2025-02-06 13:09:16,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:09:16,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:09:16,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:16,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:16,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:16,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269050082] [2025-02-06 13:09:16,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269050082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:16,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:16,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127231989] [2025-02-06 13:09:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:16,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:16,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:16,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2025-02-06 13:09:16,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:16,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:16,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2025-02-06 13:09:16,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:16,750 INFO L124 PetriNetUnfolderBase]: 921/1331 cut-off events. [2025-02-06 13:09:16,750 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-06 13:09:16,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 1331 events. 921/1331 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5338 event pairs, 608 based on Foata normal form. 0/1251 useless extension candidates. Maximal degree in co-relation 2620. Up to 1263 conditions per place. [2025-02-06 13:09:16,756 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 33 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-02-06 13:09:16,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 216 flow [2025-02-06 13:09:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-02-06 13:09:16,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2025-02-06 13:09:16,758 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 152 flow. Second operand 4 states and 96 transitions. [2025-02-06 13:09:16,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 216 flow [2025-02-06 13:09:16,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 174 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-06 13:09:16,760 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 108 flow [2025-02-06 13:09:16,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2025-02-06 13:09:16,760 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2025-02-06 13:09:16,760 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 108 flow [2025-02-06 13:09:16,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:16,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:16,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:09:16,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:09:16,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:16,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1661832091, now seen corresponding path program 1 times [2025-02-06 13:09:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206950129] [2025-02-06 13:09:16,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:16,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:09:16,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:09:16,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:16,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206950129] [2025-02-06 13:09:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206950129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:16,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:16,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:16,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550952733] [2025-02-06 13:09:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:16,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:16,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:16,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:16,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:16,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:09:16,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:16,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:16,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:09:16,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:17,029 INFO L124 PetriNetUnfolderBase]: 920/1330 cut-off events. [2025-02-06 13:09:17,029 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-06 13:09:17,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 1330 events. 920/1330 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5290 event pairs, 608 based on Foata normal form. 1/1253 useless extension candidates. Maximal degree in co-relation 2612. Up to 1268 conditions per place. [2025-02-06 13:09:17,042 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 34 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-02-06 13:09:17,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 176 flow [2025-02-06 13:09:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-02-06 13:09:17,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-02-06 13:09:17,045 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 108 flow. Second operand 3 states and 94 transitions. [2025-02-06 13:09:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 176 flow [2025-02-06 13:09:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:17,046 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 104 flow [2025-02-06 13:09:17,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-02-06 13:09:17,047 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2025-02-06 13:09:17,047 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 104 flow [2025-02-06 13:09:17,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:17,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:17,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:09:17,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash 904155996, now seen corresponding path program 1 times [2025-02-06 13:09:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:17,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298258480] [2025-02-06 13:09:17,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:17,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:09:17,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:09:17,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298258480] [2025-02-06 13:09:17,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298258480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991992570] [2025-02-06 13:09:17,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:17,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:17,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:17,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:09:17,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:09:17,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:09:17,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:17,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:17,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:09:17,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:17,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 13:09:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:17,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991992570] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:09:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-02-06 13:09:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394079455] [2025-02-06 13:09:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:17,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:09:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:17,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:09:17,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:09:17,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-02-06 13:09:17,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:17,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:17,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-02-06 13:09:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:17,755 INFO L124 PetriNetUnfolderBase]: 1300/1934 cut-off events. [2025-02-06 13:09:17,755 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-06 13:09:17,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3757 conditions, 1934 events. 1300/1934 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8894 event pairs, 442 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 3746. Up to 979 conditions per place. [2025-02-06 13:09:17,766 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 47 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-02-06 13:09:17,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 250 flow [2025-02-06 13:09:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:09:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:09:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2025-02-06 13:09:17,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2025-02-06 13:09:17,767 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 104 flow. Second operand 6 states and 162 transitions. [2025-02-06 13:09:17,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 250 flow [2025-02-06 13:09:17,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:17,769 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 134 flow [2025-02-06 13:09:17,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-02-06 13:09:17,769 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2025-02-06 13:09:17,769 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 134 flow [2025-02-06 13:09:17,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:17,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:17,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:17,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:09:17,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:17,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1306167226, now seen corresponding path program 1 times [2025-02-06 13:09:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:17,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422049122] [2025-02-06 13:09:17,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:17,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:09:17,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:09:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422049122] [2025-02-06 13:09:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422049122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573140956] [2025-02-06 13:09:18,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:18,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:18,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:18,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:09:18,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:09:18,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:09:18,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:09:18,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:18,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573140956] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:18,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 13:09:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320588041] [2025-02-06 13:09:18,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:09:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:18,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:09:18,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:09:18,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:18,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 134 flow. Second operand has 13 states, 13 states have (on average 20.846153846153847) internal successors, (271), 13 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:18,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:18,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,853 INFO L124 PetriNetUnfolderBase]: 1917/2836 cut-off events. [2025-02-06 13:09:18,853 INFO L125 PetriNetUnfolderBase]: For 1695/1839 co-relation queries the response was YES. [2025-02-06 13:09:18,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6713 conditions, 2836 events. 1917/2836 cut-off events. For 1695/1839 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13286 event pairs, 1148 based on Foata normal form. 0/2625 useless extension candidates. Maximal degree in co-relation 4590. Up to 1832 conditions per place. [2025-02-06 13:09:18,872 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 73 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2025-02-06 13:09:18,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 428 flow [2025-02-06 13:09:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:09:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:09:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2025-02-06 13:09:18,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5147783251231527 [2025-02-06 13:09:18,873 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 134 flow. Second operand 7 states and 209 transitions. [2025-02-06 13:09:18,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 428 flow [2025-02-06 13:09:18,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 422 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:18,876 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 159 flow [2025-02-06 13:09:18,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-02-06 13:09:18,876 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-02-06 13:09:18,877 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 159 flow [2025-02-06 13:09:18,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.846153846153847) internal successors, (271), 13 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,877 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:18,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:09:19,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:19,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:19,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash -996833541, now seen corresponding path program 2 times [2025-02-06 13:09:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:19,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490009337] [2025-02-06 13:09:19,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:19,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 13:09:19,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:19,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:19,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490009337] [2025-02-06 13:09:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490009337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896380526] [2025-02-06 13:09:19,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:19,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:19,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:09:19,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 13:09:19,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:19,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:19,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:19,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:09:19,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:19,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:19,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 13:09:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896380526] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:19,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:19,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-02-06 13:09:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508993668] [2025-02-06 13:09:19,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:19,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:09:19,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:19,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:09:19,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:09:19,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2025-02-06 13:09:19,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 159 flow. Second operand has 16 states, 16 states have (on average 19.125) internal successors, (306), 16 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:19,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:19,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2025-02-06 13:09:19,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:20,854 INFO L124 PetriNetUnfolderBase]: 2903/4190 cut-off events. [2025-02-06 13:09:20,855 INFO L125 PetriNetUnfolderBase]: For 2808/3068 co-relation queries the response was YES. [2025-02-06 13:09:20,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10558 conditions, 4190 events. 2903/4190 cut-off events. For 2808/3068 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 20010 event pairs, 512 based on Foata normal form. 0/3862 useless extension candidates. Maximal degree in co-relation 8125. Up to 1217 conditions per place. [2025-02-06 13:09:20,880 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 125 selfloop transitions, 13 changer transitions 0/144 dead transitions. [2025-02-06 13:09:20,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 144 transitions, 743 flow [2025-02-06 13:09:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:09:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:09:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 317 transitions. [2025-02-06 13:09:20,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49686520376175547 [2025-02-06 13:09:20,881 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 159 flow. Second operand 11 states and 317 transitions. [2025-02-06 13:09:20,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 144 transitions, 743 flow [2025-02-06 13:09:20,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 144 transitions, 732 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:20,886 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2025-02-06 13:09:20,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-02-06 13:09:20,887 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-02-06 13:09:20,887 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2025-02-06 13:09:20,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.125) internal successors, (306), 16 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:20,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:20,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:20,897 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:09:21,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 13:09:21,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:21,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1003143524, now seen corresponding path program 1 times [2025-02-06 13:09:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230107686] [2025-02-06 13:09:21,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:21,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:21,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:09:21,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:21,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230107686] [2025-02-06 13:09:21,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230107686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729164701] [2025-02-06 13:09:21,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:21,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:21,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:21,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:09:21,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:09:21,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:21,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:21,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:21,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:09:21,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:21,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:21,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729164701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:21,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 13:09:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773913864] [2025-02-06 13:09:21,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:21,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:09:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:21,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:09:21,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:09:21,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:21,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 14 states, 14 states have (on average 21.142857142857142) internal successors, (296), 14 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:21,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:21,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:21,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:21,948 INFO L124 PetriNetUnfolderBase]: 3066/4526 cut-off events. [2025-02-06 13:09:21,948 INFO L125 PetriNetUnfolderBase]: For 3583/3740 co-relation queries the response was YES. [2025-02-06 13:09:21,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11888 conditions, 4526 events. 3066/4526 cut-off events. For 3583/3740 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 22113 event pairs, 1769 based on Foata normal form. 38/4362 useless extension candidates. Maximal degree in co-relation 9154. Up to 3292 conditions per place. [2025-02-06 13:09:21,967 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 80 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2025-02-06 13:09:21,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 97 transitions, 510 flow [2025-02-06 13:09:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2025-02-06 13:09:21,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5150862068965517 [2025-02-06 13:09:21,972 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 8 states and 239 transitions. [2025-02-06 13:09:21,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 97 transitions, 510 flow [2025-02-06 13:09:21,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 476 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-06 13:09:21,979 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 225 flow [2025-02-06 13:09:21,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=225, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-02-06 13:09:21,980 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2025-02-06 13:09:21,981 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 225 flow [2025-02-06 13:09:21,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.142857142857142) internal successors, (296), 14 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:21,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:21,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:21,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:22,186 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:09:22,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:22,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1069321422, now seen corresponding path program 1 times [2025-02-06 13:09:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112677384] [2025-02-06 13:09:22,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:22,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:09:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:22,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112677384] [2025-02-06 13:09:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112677384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:22,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113133544] [2025-02-06 13:09:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:09:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:22,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:09:22,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:09:22,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:09:22,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:22,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:22,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:09:22,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:22,889 INFO L124 PetriNetUnfolderBase]: 3012/4513 cut-off events. [2025-02-06 13:09:22,890 INFO L125 PetriNetUnfolderBase]: For 5505/5804 co-relation queries the response was YES. [2025-02-06 13:09:22,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12111 conditions, 4513 events. 3012/4513 cut-off events. For 5505/5804 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 22621 event pairs, 1319 based on Foata normal form. 0/4342 useless extension candidates. Maximal degree in co-relation 9095. Up to 2772 conditions per place. [2025-02-06 13:09:22,914 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 66 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-02-06 13:09:22,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 506 flow [2025-02-06 13:09:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:09:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:09:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-02-06 13:09:22,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5137931034482759 [2025-02-06 13:09:22,918 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 225 flow. Second operand 5 states and 149 transitions. [2025-02-06 13:09:22,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 506 flow [2025-02-06 13:09:22,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 491 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:22,924 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 246 flow [2025-02-06 13:09:22,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-02-06 13:09:22,924 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-02-06 13:09:22,924 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 246 flow [2025-02-06 13:09:22,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:22,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:22,924 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:22,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:09:22,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash -272436123, now seen corresponding path program 2 times [2025-02-06 13:09:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210353961] [2025-02-06 13:09:22,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:22,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 13:09:22,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:09:22,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:22,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:23,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:23,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210353961] [2025-02-06 13:09:23,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210353961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:23,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344740635] [2025-02-06 13:09:23,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:23,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:23,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:23,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:23,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:09:23,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 13:09:23,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:09:23,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:23,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:23,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:09:23,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:23,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:23,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-06 13:09:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344740635] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:23,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-06 13:09:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820111857] [2025-02-06 13:09:23,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 13:09:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:23,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 13:09:23,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-06 13:09:23,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2025-02-06 13:09:23,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 246 flow. Second operand has 20 states, 20 states have (on average 19.05) internal successors, (381), 20 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:23,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:23,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2025-02-06 13:09:23,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:25,271 INFO L124 PetriNetUnfolderBase]: 6106/8615 cut-off events. [2025-02-06 13:09:25,271 INFO L125 PetriNetUnfolderBase]: For 9396/9593 co-relation queries the response was YES. [2025-02-06 13:09:25,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25514 conditions, 8615 events. 6106/8615 cut-off events. For 9396/9593 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 42463 event pairs, 609 based on Foata normal form. 228/8835 useless extension candidates. Maximal degree in co-relation 21669. Up to 1898 conditions per place. [2025-02-06 13:09:25,320 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 184 selfloop transitions, 18 changer transitions 0/208 dead transitions. [2025-02-06 13:09:25,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 208 transitions, 1254 flow [2025-02-06 13:09:25,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:09:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:09:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 414 transitions. [2025-02-06 13:09:25,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098522167487685 [2025-02-06 13:09:25,323 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 246 flow. Second operand 14 states and 414 transitions. [2025-02-06 13:09:25,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 208 transitions, 1254 flow [2025-02-06 13:09:25,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 208 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:25,336 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 315 flow [2025-02-06 13:09:25,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=315, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2025-02-06 13:09:25,336 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2025-02-06 13:09:25,336 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 315 flow [2025-02-06 13:09:25,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 19.05) internal successors, (381), 20 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:25,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:25,337 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:25,343 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:09:25,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:09:25,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash 382852420, now seen corresponding path program 1 times [2025-02-06 13:09:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780271371] [2025-02-06 13:09:25,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:25,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:25,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780271371] [2025-02-06 13:09:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780271371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576776588] [2025-02-06 13:09:25,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:25,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:25,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:25,674 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:25,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:09:25,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:25,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:25,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:25,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:25,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:09:25,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:25,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576776588] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:25,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 13:09:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344971967] [2025-02-06 13:09:25,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:25,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:09:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:25,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:09:25,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:09:25,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:25,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 315 flow. Second operand has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:25,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:25,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:25,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:26,690 INFO L124 PetriNetUnfolderBase]: 6186/8628 cut-off events. [2025-02-06 13:09:26,691 INFO L125 PetriNetUnfolderBase]: For 16807/17152 co-relation queries the response was YES. [2025-02-06 13:09:26,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27173 conditions, 8628 events. 6186/8628 cut-off events. For 16807/17152 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 40229 event pairs, 3675 based on Foata normal form. 40/8634 useless extension candidates. Maximal degree in co-relation 23799. Up to 7248 conditions per place. [2025-02-06 13:09:26,740 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 85 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-02-06 13:09:26,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 711 flow [2025-02-06 13:09:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2025-02-06 13:09:26,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2025-02-06 13:09:26,741 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 315 flow. Second operand 8 states and 236 transitions. [2025-02-06 13:09:26,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 711 flow [2025-02-06 13:09:26,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 626 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-02-06 13:09:26,757 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 325 flow [2025-02-06 13:09:26,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2025-02-06 13:09:26,757 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2025-02-06 13:09:26,757 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 325 flow [2025-02-06 13:09:26,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:26,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:26,757 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:26,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:26,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:26,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:26,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1460223651, now seen corresponding path program 2 times [2025-02-06 13:09:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901575843] [2025-02-06 13:09:26,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:26,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 13:09:26,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:09:26,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:26,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901575843] [2025-02-06 13:09:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901575843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409434397] [2025-02-06 13:09:27,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:27,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:27,097 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:27,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:09:27,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 13:09:27,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:09:27,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:27,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:27,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:09:27,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:27,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:27,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-02-06 13:09:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409434397] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:27,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-02-06 13:09:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092615998] [2025-02-06 13:09:27,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:27,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 13:09:27,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:27,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 13:09:27,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:09:28,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:28,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 325 flow. Second operand has 19 states, 19 states have (on average 21.36842105263158) internal successors, (406), 19 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:28,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:28,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:28,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:28,719 INFO L124 PetriNetUnfolderBase]: 6186/8458 cut-off events. [2025-02-06 13:09:28,719 INFO L125 PetriNetUnfolderBase]: For 10901/11207 co-relation queries the response was YES. [2025-02-06 13:09:28,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26746 conditions, 8458 events. 6186/8458 cut-off events. For 10901/11207 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 38516 event pairs, 1167 based on Foata normal form. 185/8626 useless extension candidates. Maximal degree in co-relation 23370. Up to 2763 conditions per place. [2025-02-06 13:09:28,764 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 122 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2025-02-06 13:09:28,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 143 transitions, 987 flow [2025-02-06 13:09:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:09:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:09:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-02-06 13:09:28,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5270935960591133 [2025-02-06 13:09:28,765 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 325 flow. Second operand 7 states and 214 transitions. [2025-02-06 13:09:28,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 143 transitions, 987 flow [2025-02-06 13:09:28,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 143 transitions, 974 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:28,781 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 354 flow [2025-02-06 13:09:28,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=354, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2025-02-06 13:09:28,782 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-02-06 13:09:28,782 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 354 flow [2025-02-06 13:09:28,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 21.36842105263158) internal successors, (406), 19 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:28,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:28,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:28,792 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:09:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:28,986 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:28,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:28,986 INFO L85 PathProgramCache]: Analyzing trace with hash -988512805, now seen corresponding path program 1 times [2025-02-06 13:09:28,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:28,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605822501] [2025-02-06 13:09:28,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:28,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:09:28,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:09:28,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:28,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:29,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605822501] [2025-02-06 13:09:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605822501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:29,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106535544] [2025-02-06 13:09:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:29,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:29,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:29,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:09:29,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:29,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:29,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:09:29,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:29,671 INFO L124 PetriNetUnfolderBase]: 5206/7678 cut-off events. [2025-02-06 13:09:29,671 INFO L125 PetriNetUnfolderBase]: For 16652/16952 co-relation queries the response was YES. [2025-02-06 13:09:29,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25903 conditions, 7678 events. 5206/7678 cut-off events. For 16652/16952 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 39213 event pairs, 1126 based on Foata normal form. 2/7661 useless extension candidates. Maximal degree in co-relation 22159. Up to 5879 conditions per place. [2025-02-06 13:09:29,719 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 79 selfloop transitions, 5 changer transitions 1/95 dead transitions. [2025-02-06 13:09:29,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 677 flow [2025-02-06 13:09:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-02-06 13:09:29,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2025-02-06 13:09:29,720 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 354 flow. Second operand 3 states and 114 transitions. [2025-02-06 13:09:29,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 677 flow [2025-02-06 13:09:29,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 643 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:29,743 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 377 flow [2025-02-06 13:09:29,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2025-02-06 13:09:29,745 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-02-06 13:09:29,745 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 377 flow [2025-02-06 13:09:29,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:29,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:29,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:29,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:09:29,745 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:29,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1302719001, now seen corresponding path program 1 times [2025-02-06 13:09:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:29,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693861016] [2025-02-06 13:09:29,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:29,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:09:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:09:29,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693861016] [2025-02-06 13:09:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693861016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668270172] [2025-02-06 13:09:29,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:29,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:29,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:29,824 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:29,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:09:29,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:09:29,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:09:29,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:29,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:29,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:09:29,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:29,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668270172] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:29,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:09:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-02-06 13:09:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624857376] [2025-02-06 13:09:29,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:29,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:09:29,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:29,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:09:29,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:09:29,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:29,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:29,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:29,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:29,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:30,415 INFO L124 PetriNetUnfolderBase]: 5997/8663 cut-off events. [2025-02-06 13:09:30,415 INFO L125 PetriNetUnfolderBase]: For 17591/17965 co-relation queries the response was YES. [2025-02-06 13:09:30,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28271 conditions, 8663 events. 5997/8663 cut-off events. For 17591/17965 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 45809 event pairs, 1088 based on Foata normal form. 174/8717 useless extension candidates. Maximal degree in co-relation 24614. Up to 5546 conditions per place. [2025-02-06 13:09:30,471 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 77 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2025-02-06 13:09:30,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 709 flow [2025-02-06 13:09:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:09:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:09:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-02-06 13:09:30,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2025-02-06 13:09:30,472 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 377 flow. Second operand 5 states and 144 transitions. [2025-02-06 13:09:30,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 709 flow [2025-02-06 13:09:30,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 96 transitions, 684 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:30,488 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 392 flow [2025-02-06 13:09:30,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2025-02-06 13:09:30,489 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-02-06 13:09:30,489 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 392 flow [2025-02-06 13:09:30,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:30,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:30,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:30,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:30,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash 495324343, now seen corresponding path program 1 times [2025-02-06 13:09:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980149112] [2025-02-06 13:09:30,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:30,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:30,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:09:30,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:09:30,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:30,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980149112] [2025-02-06 13:09:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980149112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:30,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:30,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558154753] [2025-02-06 13:09:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:09:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:30,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:09:30,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:09:30,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:09:30,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:30,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:30,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:09:30,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:31,456 INFO L124 PetriNetUnfolderBase]: 6716/9903 cut-off events. [2025-02-06 13:09:31,456 INFO L125 PetriNetUnfolderBase]: For 24212/24634 co-relation queries the response was YES. [2025-02-06 13:09:31,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32921 conditions, 9903 events. 6716/9903 cut-off events. For 24212/24634 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 54716 event pairs, 1249 based on Foata normal form. 8/9853 useless extension candidates. Maximal degree in co-relation 28770. Up to 5096 conditions per place. [2025-02-06 13:09:31,518 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 128 selfloop transitions, 25 changer transitions 2/166 dead transitions. [2025-02-06 13:09:31,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 166 transitions, 1208 flow [2025-02-06 13:09:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:09:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:09:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2025-02-06 13:09:31,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.646551724137931 [2025-02-06 13:09:31,524 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 392 flow. Second operand 6 states and 225 transitions. [2025-02-06 13:09:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 166 transitions, 1208 flow [2025-02-06 13:09:31,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 166 transitions, 1177 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:31,574 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 627 flow [2025-02-06 13:09:31,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=627, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-02-06 13:09:31,574 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-02-06 13:09:31,574 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 627 flow [2025-02-06 13:09:31,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:31,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:31,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:31,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:09:31,574 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:31,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1351983978, now seen corresponding path program 1 times [2025-02-06 13:09:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997081231] [2025-02-06 13:09:31,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:31,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:09:31,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:09:31,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:31,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:31,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997081231] [2025-02-06 13:09:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997081231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022256203] [2025-02-06 13:09:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:31,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:31,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:31,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:31,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:09:31,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 627 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:09:31,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:31,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:09:31,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:32,366 INFO L124 PetriNetUnfolderBase]: 7497/10568 cut-off events. [2025-02-06 13:09:32,367 INFO L125 PetriNetUnfolderBase]: For 26319/26738 co-relation queries the response was YES. [2025-02-06 13:09:32,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37187 conditions, 10568 events. 7497/10568 cut-off events. For 26319/26738 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 54637 event pairs, 1886 based on Foata normal form. 397/10759 useless extension candidates. Maximal degree in co-relation 32989. Up to 5659 conditions per place. [2025-02-06 13:09:32,436 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 117 selfloop transitions, 8 changer transitions 0/134 dead transitions. [2025-02-06 13:09:32,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 1238 flow [2025-02-06 13:09:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-02-06 13:09:32,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-02-06 13:09:32,438 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 627 flow. Second operand 4 states and 124 transitions. [2025-02-06 13:09:32,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 1238 flow [2025-02-06 13:09:32,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 134 transitions, 1195 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-02-06 13:09:32,489 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 601 flow [2025-02-06 13:09:32,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=601, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2025-02-06 13:09:32,489 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-02-06 13:09:32,489 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 601 flow [2025-02-06 13:09:32,489 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:09:32,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:32,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:32,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:09:32,490 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:32,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2102305101, now seen corresponding path program 1 times [2025-02-06 13:09:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:32,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447531534] [2025-02-06 13:09:32,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:32,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:09:32,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:09:32,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:32,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:33,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:33,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447531534] [2025-02-06 13:09:33,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447531534] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:33,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157252772] [2025-02-06 13:09:33,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:33,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:33,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:33,084 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:33,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:09:33,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:09:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:09:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:33,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 13:09:33,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:33,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:09:33,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2025-02-06 13:09:33,551 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 43 treesize of output 41 [2025-02-06 13:09:33,555 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 41 treesize of output 39 [2025-02-06 13:09:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:33,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:33,718 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 79 treesize of output 77 [2025-02-06 13:09:33,732 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 77 treesize of output 75 [2025-02-06 13:09:34,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 157 [2025-02-06 13:09:34,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:09:34,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 218 [2025-02-06 13:09:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:39,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157252772] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:39,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:39,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-02-06 13:09:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470467643] [2025-02-06 13:09:39,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:39,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 13:09:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:39,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 13:09:39,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2025-02-06 13:09:40,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-02-06 13:09:40,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 601 flow. Second operand has 29 states, 29 states have (on average 20.689655172413794) internal successors, (600), 29 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:40,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:40,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-02-06 13:09:40,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:44,899 INFO L124 PetriNetUnfolderBase]: 13110/18519 cut-off events. [2025-02-06 13:09:44,899 INFO L125 PetriNetUnfolderBase]: For 45027/45767 co-relation queries the response was YES. [2025-02-06 13:09:44,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65114 conditions, 18519 events. 13110/18519 cut-off events. For 45027/45767 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 101603 event pairs, 602 based on Foata normal form. 5/18522 useless extension candidates. Maximal degree in co-relation 57370. Up to 10311 conditions per place. [2025-02-06 13:09:45,024 INFO L140 encePairwiseOnDemand]: 42/58 looper letters, 331 selfloop transitions, 108 changer transitions 81/528 dead transitions. [2025-02-06 13:09:45,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 528 transitions, 3750 flow [2025-02-06 13:09:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 13:09:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-02-06 13:09:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 1241 transitions. [2025-02-06 13:09:45,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49759422614274257 [2025-02-06 13:09:45,028 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 601 flow. Second operand 43 states and 1241 transitions. [2025-02-06 13:09:45,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 528 transitions, 3750 flow [2025-02-06 13:09:45,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 528 transitions, 3668 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:45,159 INFO L231 Difference]: Finished difference. Result has 147 places, 176 transitions, 1640 flow [2025-02-06 13:09:45,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1640, PETRI_PLACES=147, PETRI_TRANSITIONS=176} [2025-02-06 13:09:45,160 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 89 predicate places. [2025-02-06 13:09:45,160 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 176 transitions, 1640 flow [2025-02-06 13:09:45,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 20.689655172413794) internal successors, (600), 29 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:45,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:45,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:45,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:45,361 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:09:45,361 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:09:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash -539387165, now seen corresponding path program 2 times [2025-02-06 13:09:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367327879] [2025-02-06 13:09:45,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:45,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 13:09:45,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:09:45,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367327879] [2025-02-06 13:09:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367327879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035654192] [2025-02-06 13:09:45,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:45,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:45,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:45,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:45,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 13:09:45,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 13:09:45,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:09:45,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:45,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:45,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 13:09:45,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:45,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:09:46,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 13:09:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:46,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:46,149 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 79 treesize of output 77 [2025-02-06 13:09:46,154 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 77 treesize of output 75 [2025-02-06 13:09:46,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 169 [2025-02-06 13:09:46,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:09:46,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2025-02-06 13:09:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035654192] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:52,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-02-06 13:09:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403303809] [2025-02-06 13:09:52,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 13:09:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:52,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 13:09:52,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-02-06 13:09:54,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-02-06 13:09:54,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 176 transitions, 1640 flow. Second operand has 30 states, 30 states have (on average 20.5) internal successors, (615), 30 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:54,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:54,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-02-06 13:09:54,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:59,444 INFO L124 PetriNetUnfolderBase]: 15086/22434 cut-off events. [2025-02-06 13:09:59,444 INFO L125 PetriNetUnfolderBase]: For 96349/96850 co-relation queries the response was YES. [2025-02-06 13:09:59,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94239 conditions, 22434 events. 15086/22434 cut-off events. For 96349/96850 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 137917 event pairs, 1091 based on Foata normal form. 144/22188 useless extension candidates. Maximal degree in co-relation 94159. Up to 14905 conditions per place. [2025-02-06 13:09:59,688 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 337 selfloop transitions, 337 changer transitions 42/730 dead transitions. [2025-02-06 13:09:59,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 730 transitions, 7508 flow [2025-02-06 13:09:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-06 13:09:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-02-06 13:09:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 1527 transitions. [2025-02-06 13:09:59,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4387931034482759 [2025-02-06 13:09:59,690 INFO L175 Difference]: Start difference. First operand has 147 places, 176 transitions, 1640 flow. Second operand 60 states and 1527 transitions. [2025-02-06 13:09:59,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 730 transitions, 7508 flow [2025-02-06 13:10:00,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 730 transitions, 7055 flow, removed 173 selfloop flow, removed 11 redundant places. [2025-02-06 13:10:00,202 INFO L231 Difference]: Finished difference. Result has 229 places, 481 transitions, 5874 flow [2025-02-06 13:10:00,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=5874, PETRI_PLACES=229, PETRI_TRANSITIONS=481} [2025-02-06 13:10:00,202 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 171 predicate places. [2025-02-06 13:10:00,203 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 481 transitions, 5874 flow [2025-02-06 13:10:00,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 20.5) internal successors, (615), 30 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:10:00,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:00,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:10:00,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 13:10:00,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:00,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:10:00,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1528038677, now seen corresponding path program 3 times [2025-02-06 13:10:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187432311] [2025-02-06 13:10:00,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:10:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:00,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-02-06 13:10:00,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 28 statements. [2025-02-06 13:10:00,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:10:00,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:10:00,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187432311] [2025-02-06 13:10:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187432311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:10:00,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:10:00,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 13:10:00,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879302195] [2025-02-06 13:10:00,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:00,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:10:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:00,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:10:00,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:10:00,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-02-06 13:10:00,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 481 transitions, 5874 flow. Second operand has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 12 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:10:00,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:00,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-02-06 13:10:00,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:04,549 INFO L124 PetriNetUnfolderBase]: 15721/23400 cut-off events. [2025-02-06 13:10:04,550 INFO L125 PetriNetUnfolderBase]: For 162697/163203 co-relation queries the response was YES. [2025-02-06 13:10:04,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119699 conditions, 23400 events. 15721/23400 cut-off events. For 162697/163203 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 144648 event pairs, 1811 based on Foata normal form. 40/23025 useless extension candidates. Maximal degree in co-relation 118777. Up to 19803 conditions per place. [2025-02-06 13:10:04,937 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 460 selfloop transitions, 204 changer transitions 12/690 dead transitions. [2025-02-06 13:10:04,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 690 transitions, 9524 flow [2025-02-06 13:10:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:10:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 13:10:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 348 transitions. [2025-02-06 13:10:04,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 13:10:04,938 INFO L175 Difference]: Start difference. First operand has 229 places, 481 transitions, 5874 flow. Second operand 12 states and 348 transitions. [2025-02-06 13:10:04,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 690 transitions, 9524 flow [2025-02-06 13:10:05,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 690 transitions, 9171 flow, removed 171 selfloop flow, removed 6 redundant places. [2025-02-06 13:10:05,841 INFO L231 Difference]: Finished difference. Result has 236 places, 576 transitions, 7594 flow [2025-02-06 13:10:05,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=5613, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7594, PETRI_PLACES=236, PETRI_TRANSITIONS=576} [2025-02-06 13:10:05,841 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 178 predicate places. [2025-02-06 13:10:05,841 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 576 transitions, 7594 flow [2025-02-06 13:10:05,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 12 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:10:05,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:05,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:10:05,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 13:10:05,842 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:10:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1940022165, now seen corresponding path program 4 times [2025-02-06 13:10:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086539184] [2025-02-06 13:10:05,842 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:10:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:05,847 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 13:10:05,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:10:05,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:10:05,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086539184] [2025-02-06 13:10:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086539184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045861313] [2025-02-06 13:10:06,250 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:10:06,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:06,252 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:10:06,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 13:10:06,295 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 13:10:06,311 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:10:06,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:10:06,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:06,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 13:10:06,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:06,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:10:06,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2025-02-06 13:10:06,574 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 38 treesize of output 36 [2025-02-06 13:10:06,577 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 36 treesize of output 34 [2025-02-06 13:10:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:06,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:10:06,837 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 79 treesize of output 77 [2025-02-06 13:10:06,840 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 77 treesize of output 75 [2025-02-06 13:10:07,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 169 [2025-02-06 13:10:07,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:10:07,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2025-02-06 13:10:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045861313] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:10:13,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:10:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-02-06 13:10:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889138591] [2025-02-06 13:10:13,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:10:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 13:10:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:13,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 13:10:13,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2025-02-06 13:10:14,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-02-06 13:10:14,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 576 transitions, 7594 flow. Second operand has 31 states, 31 states have (on average 20.419354838709676) internal successors, (633), 31 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:10:14,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:14,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-02-06 13:10:14,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:22,852 INFO L124 PetriNetUnfolderBase]: 18719/27786 cut-off events. [2025-02-06 13:10:22,852 INFO L125 PetriNetUnfolderBase]: For 209642/210465 co-relation queries the response was YES. [2025-02-06 13:10:23,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145867 conditions, 27786 events. 18719/27786 cut-off events. For 209642/210465 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 176796 event pairs, 1415 based on Foata normal form. 277/27623 useless extension candidates. Maximal degree in co-relation 144912. Up to 16642 conditions per place. [2025-02-06 13:10:23,405 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 474 selfloop transitions, 695 changer transitions 59/1242 dead transitions. [2025-02-06 13:10:23,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1242 transitions, 16914 flow [2025-02-06 13:10:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-02-06 13:10:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2025-02-06 13:10:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 1965 transitions. [2025-02-06 13:10:23,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4343501326259947 [2025-02-06 13:10:23,408 INFO L175 Difference]: Start difference. First operand has 236 places, 576 transitions, 7594 flow. Second operand 78 states and 1965 transitions. [2025-02-06 13:10:23,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1242 transitions, 16914 flow [2025-02-06 13:10:24,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1242 transitions, 16619 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-02-06 13:10:24,544 INFO L231 Difference]: Finished difference. Result has 337 places, 931 transitions, 14451 flow [2025-02-06 13:10:24,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=7380, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=14451, PETRI_PLACES=337, PETRI_TRANSITIONS=931} [2025-02-06 13:10:24,544 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 279 predicate places. [2025-02-06 13:10:24,545 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 931 transitions, 14451 flow [2025-02-06 13:10:24,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 20.419354838709676) internal successors, (633), 31 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:10:24,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:24,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:10:24,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 13:10:24,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:24,745 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-06 13:10:24,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1283361937, now seen corresponding path program 5 times [2025-02-06 13:10:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444833453] [2025-02-06 13:10:24,746 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:10:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:24,750 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-02-06 13:10:24,756 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:10:24,756 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:10:24,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444833453] [2025-02-06 13:10:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444833453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581382710] [2025-02-06 13:10:25,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:10:25,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:25,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:25,148 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:10:25,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 13:10:25,196 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-02-06 13:10:25,216 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:10:25,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:10:25,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:25,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 13:10:25,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:25,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:10:25,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 13:10:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:25,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:10:25,661 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 79 treesize of output 77 [2025-02-06 13:10:25,665 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 77 treesize of output 75 [2025-02-06 13:10:26,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 157 [2025-02-06 13:10:26,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:10:26,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 218 [2025-02-06 13:10:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:34,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581382710] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:10:34,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:10:34,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-02-06 13:10:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657736280] [2025-02-06 13:10:34,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:10:34,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 13:10:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:34,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 13:10:34,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-02-06 13:10:35,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:10:35,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 931 transitions, 14451 flow. Second operand has 28 states, 28 states have (on average 21.464285714285715) internal successors, (601), 28 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:10:35,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:35,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:10:35,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand