./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-lamport.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/parallel-lamport.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 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:05:04,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:05:04,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:05:04,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:05:04,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:05:04,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:05:04,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:05:04,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:05:04,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:05:04,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:05:04,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:05:04,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:05:04,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:05:04,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:05:04,831 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:05:04,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:04,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:04,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:04,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:05:04,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:05:04,833 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 -> 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 [2025-01-10 01:05:05,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:05:05,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:05:05,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:05:05,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:05:05,045 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:05:05,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-01-10 01:05:06,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa00eaa7a/50bad71a195e443f97a64c2083ce5615/FLAG8f5e018e7 [2025-01-10 01:05:06,471 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:05:06,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-01-10 01:05:06,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa00eaa7a/50bad71a195e443f97a64c2083ce5615/FLAG8f5e018e7 [2025-01-10 01:05:06,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa00eaa7a/50bad71a195e443f97a64c2083ce5615 [2025-01-10 01:05:06,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:05:06,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:05:06,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:06,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:05:06,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:05:06,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:06" (1/1) ... [2025-01-10 01:05:06,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb4eadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:06, skipping insertion in model container [2025-01-10 01:05:06,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:06" (1/1) ... [2025-01-10 01:05:06,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:05:06,948 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:05:06,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:06,962 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:05:06,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:07,002 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:05:07,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07 WrapperNode [2025-01-10 01:05:07,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:07,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:07,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:05:07,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:05:07,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,039 INFO L138 Inliner]: procedures = 22, calls = 30, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 206 [2025-01-10 01:05:07,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:07,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:05:07,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:05:07,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:05:07,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,063 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:05:07,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:05:07,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:05:07,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:05:07,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:05:07,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (1/1) ... [2025-01-10 01:05:07,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:07,113 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-01-10 01:05:07,118 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-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:05:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:05:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:05:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:05:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:05:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:05:07,150 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:05:07,256 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:05:07,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:05:07,549 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:05:07,550 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:05:07,704 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:05:07,704 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:05:07,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:07 BoogieIcfgContainer [2025-01-10 01:05:07,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:05:07,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:05:07,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:05:07,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:05:07,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:05:06" (1/3) ... [2025-01-10 01:05:07,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6054f013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:07, skipping insertion in model container [2025-01-10 01:05:07,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:07" (2/3) ... [2025-01-10 01:05:07,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6054f013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:07, skipping insertion in model container [2025-01-10 01:05:07,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:07" (3/3) ... [2025-01-10 01:05:07,712 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2025-01-10 01:05:07,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:05:07,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-lamport.wvr.c that has 4 procedures, 75 locations, 1 initial locations, 1 loop locations, and 12 error locations. [2025-01-10 01:05:07,725 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:05:07,796 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:05:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 75 transitions, 171 flow [2025-01-10 01:05:07,861 INFO L124 PetriNetUnfolderBase]: 1/72 cut-off events. [2025-01-10 01:05:07,864 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:05:07,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 72 events. 1/72 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 01:05:07,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 75 transitions, 171 flow [2025-01-10 01:05:07,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 71 transitions, 160 flow [2025-01-10 01:05:07,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:05:07,886 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;@76a7306d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:05:07,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 01:05:07,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:05:07,894 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2025-01-10 01:05:07,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:05:07,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:07,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:07,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:07,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash 637255951, now seen corresponding path program 1 times [2025-01-10 01:05:07,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:07,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734623477] [2025-01-10 01:05:07,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:07,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:05:07,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:05:07,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:07,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734623477] [2025-01-10 01:05:08,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734623477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:08,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:05:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252091253] [2025-01-10 01:05:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:08,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:08,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:08,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:08,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2025-01-10 01:05:08,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-01-10 01:05:08,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:08,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2025-01-10 01:05:08,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:08,276 INFO L124 PetriNetUnfolderBase]: 235/602 cut-off events. [2025-01-10 01:05:08,276 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 01:05:08,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 602 events. 235/602 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3829 event pairs, 234 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 934. Up to 395 conditions per place. [2025-01-10 01:05:08,282 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 26 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-10 01:05:08,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 68 transitions, 210 flow [2025-01-10 01:05:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 01:05:08,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-01-10 01:05:08,291 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 160 flow. Second operand 3 states and 162 transitions. [2025-01-10 01:05:08,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 68 transitions, 210 flow [2025-01-10 01:05:08,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 198 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:08,296 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 146 flow [2025-01-10 01:05:08,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-01-10 01:05:08,300 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2025-01-10 01:05:08,300 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 146 flow [2025-01-10 01:05:08,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-01-10 01:05:08,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:08,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:05:08,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash 637255952, now seen corresponding path program 1 times [2025-01-10 01:05:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210140463] [2025-01-10 01:05:08,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:08,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:05:08,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:05:08,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:08,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210140463] [2025-01-10 01:05:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210140463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:05:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139946582] [2025-01-10 01:05:08,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:08,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:05:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:08,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:05:08,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:05:08,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2025-01-10 01:05:08,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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-01-10 01:05:08,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:08,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2025-01-10 01:05:08,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:08,850 INFO L124 PetriNetUnfolderBase]: 236/605 cut-off events. [2025-01-10 01:05:08,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:05:08,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 605 events. 236/605 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3833 event pairs, 234 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 996. Up to 398 conditions per place. [2025-01-10 01:05:08,854 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 27 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-01-10 01:05:08,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 220 flow [2025-01-10 01:05:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:05:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:05:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2025-01-10 01:05:08,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2025-01-10 01:05:08,856 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 146 flow. Second operand 6 states and 292 transitions. [2025-01-10 01:05:08,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 220 flow [2025-01-10 01:05:08,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:08,862 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 173 flow [2025-01-10 01:05:08,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-01-10 01:05:08,863 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2025-01-10 01:05:08,863 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 173 flow [2025-01-10 01:05:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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-01-10 01:05:08,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:08,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:08,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:05:08,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:08,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1777334915, now seen corresponding path program 1 times [2025-01-10 01:05:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83337259] [2025-01-10 01:05:08,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:08,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:05:08,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:05:08,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:08,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83337259] [2025-01-10 01:05:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83337259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259550815] [2025-01-10 01:05:09,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:09,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:09,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:09,128 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-01-10 01:05:09,131 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-01-10 01:05:09,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:05:09,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:05:09,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:09,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:09,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:05:09,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:09,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:05:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:09,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:09,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259550815] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:09,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:09,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:05:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543864147] [2025-01-10 01:05:09,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:09,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:05:09,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:09,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:05:09,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:05:10,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2025-01-10 01:05:10,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 173 flow. Second operand has 15 states, 15 states have (on average 44.53333333333333) internal successors, (668), 15 states have internal predecessors, (668), 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-01-10 01:05:10,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:10,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2025-01-10 01:05:10,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:10,378 INFO L124 PetriNetUnfolderBase]: 236/604 cut-off events. [2025-01-10 01:05:10,378 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:05:10,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 604 events. 236/604 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3808 event pairs, 234 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 1021. Up to 394 conditions per place. [2025-01-10 01:05:10,382 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 23 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2025-01-10 01:05:10,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 70 transitions, 233 flow [2025-01-10 01:05:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:05:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:05:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 377 transitions. [2025-01-10 01:05:10,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6283333333333333 [2025-01-10 01:05:10,384 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 173 flow. Second operand 8 states and 377 transitions. [2025-01-10 01:05:10,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 70 transitions, 233 flow [2025-01-10 01:05:10,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:10,390 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 180 flow [2025-01-10 01:05:10,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=180, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2025-01-10 01:05:10,390 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2025-01-10 01:05:10,391 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 180 flow [2025-01-10 01:05:10,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 44.53333333333333) internal successors, (668), 15 states have internal predecessors, (668), 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-01-10 01:05:10,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:10,391 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-01-10 01:05:10,407 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-01-10 01:05:10,591 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-01-10 01:05:10,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:10,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2143964269, now seen corresponding path program 1 times [2025-01-10 01:05:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:10,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784493580] [2025-01-10 01:05:10,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:10,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:05:10,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:05:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784493580] [2025-01-10 01:05:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784493580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930921235] [2025-01-10 01:05:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:10,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:10,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:10,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-01-10 01:05:10,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:10,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:10,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-01-10 01:05:10,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:10,881 INFO L124 PetriNetUnfolderBase]: 610/1171 cut-off events. [2025-01-10 01:05:10,881 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:05:10,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1171 events. 610/1171 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7381 event pairs, 608 based on Foata normal form. 0/1077 useless extension candidates. Maximal degree in co-relation 2161. Up to 953 conditions per place. [2025-01-10 01:05:10,887 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 32 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-01-10 01:05:10,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 242 flow [2025-01-10 01:05:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-01-10 01:05:10,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 01:05:10,888 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 180 flow. Second operand 4 states and 180 transitions. [2025-01-10 01:05:10,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 242 flow [2025-01-10 01:05:10,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 208 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-01-10 01:05:10,890 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 144 flow [2025-01-10 01:05:10,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-01-10 01:05:10,891 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-01-10 01:05:10,891 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 144 flow [2025-01-10 01:05:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:10,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:10,891 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-01-10 01:05:10,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:05:10,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2143964268, now seen corresponding path program 1 times [2025-01-10 01:05:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460655017] [2025-01-10 01:05:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:10,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:05:10,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:05:10,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:10,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460655017] [2025-01-10 01:05:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460655017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:10,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494162628] [2025-01-10 01:05:10,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:10,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:10,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:10,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:10,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2025-01-10 01:05:10,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-01-10 01:05:10,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:10,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2025-01-10 01:05:10,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:11,047 INFO L124 PetriNetUnfolderBase]: 235/566 cut-off events. [2025-01-10 01:05:11,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:05:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 566 events. 235/566 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3423 event pairs, 234 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 959. Up to 399 conditions per place. [2025-01-10 01:05:11,050 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 29 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-01-10 01:05:11,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 202 flow [2025-01-10 01:05:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-01-10 01:05:11,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7288888888888889 [2025-01-10 01:05:11,051 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 144 flow. Second operand 3 states and 164 transitions. [2025-01-10 01:05:11,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 202 flow [2025-01-10 01:05:11,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:11,053 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 141 flow [2025-01-10 01:05:11,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-01-10 01:05:11,053 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-01-10 01:05:11,053 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 141 flow [2025-01-10 01:05:11,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-01-10 01:05:11,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:11,053 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-01-10 01:05:11,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:05:11,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:11,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1915902215, now seen corresponding path program 1 times [2025-01-10 01:05:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102498488] [2025-01-10 01:05:11,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:11,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:05:11,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:11,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:11,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102498488] [2025-01-10 01:05:11,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102498488] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835776744] [2025-01-10 01:05:11,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:11,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:11,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:11,248 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-01-10 01:05:11,257 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-01-10 01:05:11,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:05:11,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:05:11,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:11,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:11,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:05:11,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:11,340 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-01-10 01:05:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:11,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:05:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835776744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:11,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:05:11,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:05:11,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776318343] [2025-01-10 01:05:11,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:11,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:05:11,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:11,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:05:11,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:05:11,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-01-10 01:05:11,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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-01-10 01:05:11,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:11,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-01-10 01:05:11,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:11,655 INFO L124 PetriNetUnfolderBase]: 451/850 cut-off events. [2025-01-10 01:05:11,655 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 01:05:11,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 850 events. 451/850 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5037 event pairs, 90 based on Foata normal form. 21/808 useless extension candidates. Maximal degree in co-relation 1577. Up to 555 conditions per place. [2025-01-10 01:05:11,661 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 41 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-01-10 01:05:11,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 247 flow [2025-01-10 01:05:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-01-10 01:05:11,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6633333333333333 [2025-01-10 01:05:11,662 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 141 flow. Second operand 4 states and 199 transitions. [2025-01-10 01:05:11,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 247 flow [2025-01-10 01:05:11,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:11,664 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 141 flow [2025-01-10 01:05:11,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2025-01-10 01:05:11,665 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-01-10 01:05:11,666 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 141 flow [2025-01-10 01:05:11,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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-01-10 01:05:11,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:11,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:11,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:11,871 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-01-10 01:05:11,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:11,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash -831374481, now seen corresponding path program 1 times [2025-01-10 01:05:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:11,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532122288] [2025-01-10 01:05:11,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:11,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:05:11,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:05:11,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:11,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:12,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:12,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532122288] [2025-01-10 01:05:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532122288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:12,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420999955] [2025-01-10 01:05:12,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:12,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:12,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:12,152 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-01-10 01:05:12,153 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-01-10 01:05:12,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:05:12,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:05:12,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:12,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:12,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:05:12,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:12,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:05:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420999955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:12,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:05:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 01:05:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740890167] [2025-01-10 01:05:12,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:12,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:05:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:12,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:05:12,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:05:12,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-01-10 01:05:12,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 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-01-10 01:05:12,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:12,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-01-10 01:05:12,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:12,650 INFO L124 PetriNetUnfolderBase]: 663/1268 cut-off events. [2025-01-10 01:05:12,650 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:05:12,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 1268 events. 663/1268 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7702 event pairs, 182 based on Foata normal form. 42/1273 useless extension candidates. Maximal degree in co-relation 2377. Up to 498 conditions per place. [2025-01-10 01:05:12,657 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 66 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2025-01-10 01:05:12,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 363 flow [2025-01-10 01:05:12,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:05:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:05:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 300 transitions. [2025-01-10 01:05:12,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 01:05:12,659 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 141 flow. Second operand 6 states and 300 transitions. [2025-01-10 01:05:12,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 363 flow [2025-01-10 01:05:12,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 357 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:12,661 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 173 flow [2025-01-10 01:05:12,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-01-10 01:05:12,664 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -4 predicate places. [2025-01-10 01:05:12,664 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 173 flow [2025-01-10 01:05:12,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 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-01-10 01:05:12,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:12,664 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, 1] [2025-01-10 01:05:12,673 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-01-10 01:05:12,864 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-01-10 01:05:12,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:12,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 823032732, now seen corresponding path program 1 times [2025-01-10 01:05:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968866564] [2025-01-10 01:05:12,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:12,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:12,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:12,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:12,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968866564] [2025-01-10 01:05:13,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968866564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883614779] [2025-01-10 01:05:13,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:13,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:13,042 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-01-10 01:05:13,043 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-01-10 01:05:13,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:13,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:13,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:05:13,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:13,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:13,302 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 32 [2025-01-10 01:05:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883614779] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:13,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:13,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 01:05:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771431959] [2025-01-10 01:05:13,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:05:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:13,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:05:13,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:05:13,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-01-10 01:05:13,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 173 flow. Second operand has 17 states, 17 states have (on average 39.88235294117647) internal successors, (678), 17 states have internal predecessors, (678), 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-01-10 01:05:13,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:13,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-01-10 01:05:13,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:14,289 INFO L124 PetriNetUnfolderBase]: 1787/3044 cut-off events. [2025-01-10 01:05:14,289 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-10 01:05:14,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 3044 events. 1787/3044 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 21641 event pairs, 856 based on Foata normal form. 0/2781 useless extension candidates. Maximal degree in co-relation 3161. Up to 1154 conditions per place. [2025-01-10 01:05:14,300 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 73 selfloop transitions, 17 changer transitions 0/121 dead transitions. [2025-01-10 01:05:14,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 121 transitions, 475 flow [2025-01-10 01:05:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:05:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:05:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 498 transitions. [2025-01-10 01:05:14,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6036363636363636 [2025-01-10 01:05:14,302 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 173 flow. Second operand 11 states and 498 transitions. [2025-01-10 01:05:14,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 121 transitions, 475 flow [2025-01-10 01:05:14,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:14,304 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 252 flow [2025-01-10 01:05:14,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=252, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-01-10 01:05:14,306 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-01-10 01:05:14,306 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 252 flow [2025-01-10 01:05:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 39.88235294117647) internal successors, (678), 17 states have internal predecessors, (678), 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-01-10 01:05:14,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:14,307 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, 1] [2025-01-10 01:05:14,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:14,507 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-01-10 01:05:14,507 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:14,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 374176436, now seen corresponding path program 1 times [2025-01-10 01:05:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114240238] [2025-01-10 01:05:14,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:14,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:14,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:14,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:14,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114240238] [2025-01-10 01:05:14,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114240238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:14,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534455253] [2025-01-10 01:05:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:14,700 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-01-10 01:05:14,702 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-01-10 01:05:14,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:14,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:14,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:14,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:14,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:05:14,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:14,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:05:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534455253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:05:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 01:05:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127097409] [2025-01-10 01:05:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:14,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:05:14,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:14,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:05:14,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:05:14,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-01-10 01:05:14,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 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-01-10 01:05:14,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:14,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-01-10 01:05:14,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:15,248 INFO L124 PetriNetUnfolderBase]: 1691/3237 cut-off events. [2025-01-10 01:05:15,249 INFO L125 PetriNetUnfolderBase]: For 972/1272 co-relation queries the response was YES. [2025-01-10 01:05:15,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7016 conditions, 3237 events. 1691/3237 cut-off events. For 972/1272 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24448 event pairs, 490 based on Foata normal form. 251/3422 useless extension candidates. Maximal degree in co-relation 4904. Up to 1436 conditions per place. [2025-01-10 01:05:15,259 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 70 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2025-01-10 01:05:15,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 110 transitions, 507 flow [2025-01-10 01:05:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:05:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:05:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2025-01-10 01:05:15,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2025-01-10 01:05:15,260 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 252 flow. Second operand 6 states and 298 transitions. [2025-01-10 01:05:15,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 110 transitions, 507 flow [2025-01-10 01:05:15,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 501 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:15,263 INFO L231 Difference]: Finished difference. Result has 93 places, 78 transitions, 287 flow [2025-01-10 01:05:15,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=93, PETRI_TRANSITIONS=78} [2025-01-10 01:05:15,263 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2025-01-10 01:05:15,263 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 287 flow [2025-01-10 01:05:15,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 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-01-10 01:05:15,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:15,263 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:15,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:05:15,464 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-01-10 01:05:15,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:15,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1886275081, now seen corresponding path program 2 times [2025-01-10 01:05:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817143321] [2025-01-10 01:05:15,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:15,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:05:15,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 31 statements. [2025-01-10 01:05:15,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:15,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817143321] [2025-01-10 01:05:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817143321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:15,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:15,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:05:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337308413] [2025-01-10 01:05:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:15,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:05:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:15,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:05:15,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:05:15,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-01-10 01:05:15,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 287 flow. Second operand has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 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-01-10 01:05:15,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:15,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-01-10 01:05:15,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:16,116 INFO L124 PetriNetUnfolderBase]: 2211/3787 cut-off events. [2025-01-10 01:05:16,116 INFO L125 PetriNetUnfolderBase]: For 1125/1125 co-relation queries the response was YES. [2025-01-10 01:05:16,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8721 conditions, 3787 events. 2211/3787 cut-off events. For 1125/1125 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 28646 event pairs, 1284 based on Foata normal form. 81/3568 useless extension candidates. Maximal degree in co-relation 5201. Up to 2088 conditions per place. [2025-01-10 01:05:16,129 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 42 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2025-01-10 01:05:16,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 409 flow [2025-01-10 01:05:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:05:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:05:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 303 transitions. [2025-01-10 01:05:16,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2025-01-10 01:05:16,131 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 287 flow. Second operand 7 states and 303 transitions. [2025-01-10 01:05:16,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 409 flow [2025-01-10 01:05:16,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:16,137 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 296 flow [2025-01-10 01:05:16,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2025-01-10 01:05:16,137 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 15 predicate places. [2025-01-10 01:05:16,137 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 296 flow [2025-01-10 01:05:16,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 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-01-10 01:05:16,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:16,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:05:16,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2094399634, now seen corresponding path program 1 times [2025-01-10 01:05:16,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113881535] [2025-01-10 01:05:16,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:16,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:05:16,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:05:16,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:05:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113881535] [2025-01-10 01:05:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113881535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:16,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:16,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:05:16,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796937140] [2025-01-10 01:05:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:16,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:05:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:16,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:05:16,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:05:16,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-01-10 01:05:16,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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-01-10 01:05:16,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:16,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-01-10 01:05:16,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:16,518 INFO L124 PetriNetUnfolderBase]: 2301/4795 cut-off events. [2025-01-10 01:05:16,519 INFO L125 PetriNetUnfolderBase]: For 1372/1476 co-relation queries the response was YES. [2025-01-10 01:05:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10721 conditions, 4795 events. 2301/4795 cut-off events. For 1372/1476 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 39204 event pairs, 900 based on Foata normal form. 152/4680 useless extension candidates. Maximal degree in co-relation 5400. Up to 1605 conditions per place. [2025-01-10 01:05:16,593 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 67 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2025-01-10 01:05:16,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 111 transitions, 544 flow [2025-01-10 01:05:16,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2025-01-10 01:05:16,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696 [2025-01-10 01:05:16,594 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 296 flow. Second operand 5 states and 261 transitions. [2025-01-10 01:05:16,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 111 transitions, 544 flow [2025-01-10 01:05:16,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 510 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:16,598 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 314 flow [2025-01-10 01:05:16,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2025-01-10 01:05:16,599 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2025-01-10 01:05:16,599 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 314 flow [2025-01-10 01:05:16,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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-01-10 01:05:16,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:16,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:16,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:05:16,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1045051334, now seen corresponding path program 2 times [2025-01-10 01:05:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:16,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393152339] [2025-01-10 01:05:16,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:16,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:05:16,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-01-10 01:05:16,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:05:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393152339] [2025-01-10 01:05:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393152339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:05:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967744759] [2025-01-10 01:05:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:05:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:16,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:05:16,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:05:16,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-01-10 01:05:16,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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-01-10 01:05:16,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:16,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-01-10 01:05:16,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:16,925 INFO L124 PetriNetUnfolderBase]: 1331/3059 cut-off events. [2025-01-10 01:05:16,925 INFO L125 PetriNetUnfolderBase]: For 1230/1301 co-relation queries the response was YES. [2025-01-10 01:05:16,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7241 conditions, 3059 events. 1331/3059 cut-off events. For 1230/1301 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 24014 event pairs, 578 based on Foata normal form. 135/3068 useless extension candidates. Maximal degree in co-relation 4350. Up to 976 conditions per place. [2025-01-10 01:05:16,945 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 63 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-01-10 01:05:16,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 522 flow [2025-01-10 01:05:16,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 258 transitions. [2025-01-10 01:05:16,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.688 [2025-01-10 01:05:16,947 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 314 flow. Second operand 5 states and 258 transitions. [2025-01-10 01:05:16,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 522 flow [2025-01-10 01:05:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 107 transitions, 510 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:16,956 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 318 flow [2025-01-10 01:05:16,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2025-01-10 01:05:16,956 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-01-10 01:05:16,956 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 318 flow [2025-01-10 01:05:16,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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-01-10 01:05:16,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:16,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:16,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:05:16,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:16,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1164435021, now seen corresponding path program 1 times [2025-01-10 01:05:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792140589] [2025-01-10 01:05:16,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 01:05:16,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:05:16,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:16,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792140589] [2025-01-10 01:05:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792140589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012810661] [2025-01-10 01:05:17,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:17,227 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-01-10 01:05:17,227 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-01-10 01:05:17,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 01:05:17,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:05:17,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:17,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:17,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:05:17,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:17,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:17,688 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 32 [2025-01-10 01:05:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012810661] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:17,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-01-10 01:05:17,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501481704] [2025-01-10 01:05:17,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:17,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:05:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:17,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:05:17,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:05:18,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 01:05:18,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 318 flow. Second operand has 21 states, 21 states have (on average 36.714285714285715) internal successors, (771), 21 states have internal predecessors, (771), 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-01-10 01:05:18,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:18,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 01:05:18,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:19,674 INFO L124 PetriNetUnfolderBase]: 1635/3081 cut-off events. [2025-01-10 01:05:19,674 INFO L125 PetriNetUnfolderBase]: For 1278/1576 co-relation queries the response was YES. [2025-01-10 01:05:19,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7765 conditions, 3081 events. 1635/3081 cut-off events. For 1278/1576 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21541 event pairs, 276 based on Foata normal form. 330/3328 useless extension candidates. Maximal degree in co-relation 4332. Up to 840 conditions per place. [2025-01-10 01:05:19,687 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 115 selfloop transitions, 32 changer transitions 0/179 dead transitions. [2025-01-10 01:05:19,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 179 transitions, 892 flow [2025-01-10 01:05:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:05:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:05:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 827 transitions. [2025-01-10 01:05:19,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5513333333333333 [2025-01-10 01:05:19,689 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 318 flow. Second operand 20 states and 827 transitions. [2025-01-10 01:05:19,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 179 transitions, 892 flow [2025-01-10 01:05:19,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 179 transitions, 880 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:19,693 INFO L231 Difference]: Finished difference. Result has 116 places, 93 transitions, 429 flow [2025-01-10 01:05:19,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=429, PETRI_PLACES=116, PETRI_TRANSITIONS=93} [2025-01-10 01:05:19,694 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 36 predicate places. [2025-01-10 01:05:19,694 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 93 transitions, 429 flow [2025-01-10 01:05:19,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 36.714285714285715) internal successors, (771), 21 states have internal predecessors, (771), 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-01-10 01:05:19,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:19,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:19,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:05:19,895 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,SelfDestructingSolverStorable12 [2025-01-10 01:05:19,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:19,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash -449640640, now seen corresponding path program 1 times [2025-01-10 01:05:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:19,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449285859] [2025-01-10 01:05:19,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:19,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 01:05:19,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:05:19,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:19,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449285859] [2025-01-10 01:05:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449285859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059826561] [2025-01-10 01:05:20,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:20,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:20,066 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-01-10 01:05:20,068 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-01-10 01:05:20,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 01:05:20,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:05:20,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:20,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:20,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:05:20,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:20,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:20,417 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 32 [2025-01-10 01:05:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059826561] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:20,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:20,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-01-10 01:05:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553448416] [2025-01-10 01:05:20,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:20,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:05:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:20,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:05:20,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:05:21,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 01:05:21,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 93 transitions, 429 flow. Second operand has 21 states, 21 states have (on average 36.714285714285715) internal successors, (771), 21 states have internal predecessors, (771), 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-01-10 01:05:21,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:21,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 01:05:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:22,248 INFO L124 PetriNetUnfolderBase]: 1635/3017 cut-off events. [2025-01-10 01:05:22,248 INFO L125 PetriNetUnfolderBase]: For 1583/1849 co-relation queries the response was YES. [2025-01-10 01:05:22,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8181 conditions, 3017 events. 1635/3017 cut-off events. For 1583/1849 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20612 event pairs, 278 based on Foata normal form. 318/3252 useless extension candidates. Maximal degree in co-relation 5205. Up to 882 conditions per place. [2025-01-10 01:05:22,286 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 116 selfloop transitions, 33 changer transitions 0/180 dead transitions. [2025-01-10 01:05:22,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 180 transitions, 963 flow [2025-01-10 01:05:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:05:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:05:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 828 transitions. [2025-01-10 01:05:22,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.552 [2025-01-10 01:05:22,291 INFO L175 Difference]: Start difference. First operand has 116 places, 93 transitions, 429 flow. Second operand 20 states and 828 transitions. [2025-01-10 01:05:22,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 180 transitions, 963 flow [2025-01-10 01:05:22,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 180 transitions, 927 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-01-10 01:05:22,298 INFO L231 Difference]: Finished difference. Result has 124 places, 93 transitions, 459 flow [2025-01-10 01:05:22,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=459, PETRI_PLACES=124, PETRI_TRANSITIONS=93} [2025-01-10 01:05:22,300 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 44 predicate places. [2025-01-10 01:05:22,300 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 93 transitions, 459 flow [2025-01-10 01:05:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 36.714285714285715) internal successors, (771), 21 states have internal predecessors, (771), 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-01-10 01:05:22,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:22,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:22,310 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-01-10 01:05:22,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:22,505 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:22,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash -160264827, now seen corresponding path program 1 times [2025-01-10 01:05:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:22,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137759450] [2025-01-10 01:05:22,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:22,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 01:05:22,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:05:22,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:22,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:22,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:22,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137759450] [2025-01-10 01:05:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137759450] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:22,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739405658] [2025-01-10 01:05:22,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:22,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:22,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:22,947 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-01-10 01:05:22,949 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-01-10 01:05:22,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 01:05:23,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:05:23,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:23,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:23,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:05:23,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:23,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:23,760 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-01-10 01:05:23,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2025-01-10 01:05:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:23,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739405658] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:23,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:05:23,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 14] total 36 [2025-01-10 01:05:23,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412054248] [2025-01-10 01:05:23,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:23,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:05:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:23,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:05:23,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:05:24,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2025-01-10 01:05:24,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 93 transitions, 459 flow. Second operand has 14 states, 14 states have (on average 33.07142857142857) internal successors, (463), 14 states have internal predecessors, (463), 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-01-10 01:05:24,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:24,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2025-01-10 01:05:24,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:25,348 INFO L124 PetriNetUnfolderBase]: 4087/7067 cut-off events. [2025-01-10 01:05:25,348 INFO L125 PetriNetUnfolderBase]: For 6206/6538 co-relation queries the response was YES. [2025-01-10 01:05:25,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20410 conditions, 7067 events. 4087/7067 cut-off events. For 6206/6538 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 45800 event pairs, 944 based on Foata normal form. 306/7263 useless extension candidates. Maximal degree in co-relation 13615. Up to 5211 conditions per place. [2025-01-10 01:05:25,377 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 120 selfloop transitions, 43 changer transitions 53/238 dead transitions. [2025-01-10 01:05:25,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 238 transitions, 1705 flow [2025-01-10 01:05:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:05:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:05:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 758 transitions. [2025-01-10 01:05:25,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5053333333333333 [2025-01-10 01:05:25,379 INFO L175 Difference]: Start difference. First operand has 124 places, 93 transitions, 459 flow. Second operand 20 states and 758 transitions. [2025-01-10 01:05:25,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 238 transitions, 1705 flow [2025-01-10 01:05:25,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 238 transitions, 1553 flow, removed 8 selfloop flow, removed 17 redundant places. [2025-01-10 01:05:25,388 INFO L231 Difference]: Finished difference. Result has 142 places, 128 transitions, 864 flow [2025-01-10 01:05:25,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=864, PETRI_PLACES=142, PETRI_TRANSITIONS=128} [2025-01-10 01:05:25,388 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 62 predicate places. [2025-01-10 01:05:25,388 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 128 transitions, 864 flow [2025-01-10 01:05:25,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 33.07142857142857) internal successors, (463), 14 states have internal predecessors, (463), 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-01-10 01:05:25,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:25,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:25,394 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-01-10 01:05:25,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:05:25,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:25,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:25,594 INFO L85 PathProgramCache]: Analyzing trace with hash -253901715, now seen corresponding path program 2 times [2025-01-10 01:05:25,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:25,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982425855] [2025-01-10 01:05:25,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:25,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:05:25,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-01-10 01:05:25,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:25,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982425855] [2025-01-10 01:05:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982425855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:05:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483480711] [2025-01-10 01:05:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:25,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:25,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:25,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:26,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:05:26,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 128 transitions, 864 flow. Second operand has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:05:26,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:26,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:05:26,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:27,128 INFO L124 PetriNetUnfolderBase]: 4619/7887 cut-off events. [2025-01-10 01:05:27,128 INFO L125 PetriNetUnfolderBase]: For 14255/14689 co-relation queries the response was YES. [2025-01-10 01:05:27,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26741 conditions, 7887 events. 4619/7887 cut-off events. For 14255/14689 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 51890 event pairs, 1109 based on Foata normal form. 408/8159 useless extension candidates. Maximal degree in co-relation 26699. Up to 4778 conditions per place. [2025-01-10 01:05:27,155 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 155 selfloop transitions, 81 changer transitions 47/306 dead transitions. [2025-01-10 01:05:27,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 306 transitions, 2481 flow [2025-01-10 01:05:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 01:05:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-10 01:05:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1009 transitions. [2025-01-10 01:05:27,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4982716049382716 [2025-01-10 01:05:27,158 INFO L175 Difference]: Start difference. First operand has 142 places, 128 transitions, 864 flow. Second operand 27 states and 1009 transitions. [2025-01-10 01:05:27,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 306 transitions, 2481 flow [2025-01-10 01:05:27,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 306 transitions, 2309 flow, removed 63 selfloop flow, removed 10 redundant places. [2025-01-10 01:05:27,202 INFO L231 Difference]: Finished difference. Result has 167 places, 194 transitions, 1638 flow [2025-01-10 01:05:27,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1638, PETRI_PLACES=167, PETRI_TRANSITIONS=194} [2025-01-10 01:05:27,202 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 87 predicate places. [2025-01-10 01:05:27,202 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 194 transitions, 1638 flow [2025-01-10 01:05:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:05:27,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:27,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:05:27,203 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:27,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1824822671, now seen corresponding path program 3 times [2025-01-10 01:05:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:27,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481271578] [2025-01-10 01:05:27,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:05:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:27,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:05:27,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-01-10 01:05:27,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:05:27,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481271578] [2025-01-10 01:05:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481271578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:27,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:27,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:05:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988919646] [2025-01-10 01:05:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:27,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:27,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:27,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:27,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:05:27,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 194 transitions, 1638 flow. Second operand has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:05:27,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:27,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:05:27,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:29,328 INFO L124 PetriNetUnfolderBase]: 6343/10609 cut-off events. [2025-01-10 01:05:29,328 INFO L125 PetriNetUnfolderBase]: For 34682/35198 co-relation queries the response was YES. [2025-01-10 01:05:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40858 conditions, 10609 events. 6343/10609 cut-off events. For 34682/35198 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 72353 event pairs, 1866 based on Foata normal form. 476/10858 useless extension candidates. Maximal degree in co-relation 40805. Up to 6512 conditions per place. [2025-01-10 01:05:29,392 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 225 selfloop transitions, 145 changer transitions 39/432 dead transitions. [2025-01-10 01:05:29,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 432 transitions, 4191 flow [2025-01-10 01:05:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-10 01:05:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-01-10 01:05:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1209 transitions. [2025-01-10 01:05:29,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.50375 [2025-01-10 01:05:29,396 INFO L175 Difference]: Start difference. First operand has 167 places, 194 transitions, 1638 flow. Second operand 32 states and 1209 transitions. [2025-01-10 01:05:29,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 432 transitions, 4191 flow [2025-01-10 01:05:29,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 432 transitions, 3978 flow, removed 93 selfloop flow, removed 8 redundant places. [2025-01-10 01:05:29,523 INFO L231 Difference]: Finished difference. Result has 205 places, 289 transitions, 3009 flow [2025-01-10 01:05:29,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3009, PETRI_PLACES=205, PETRI_TRANSITIONS=289} [2025-01-10 01:05:29,524 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 125 predicate places. [2025-01-10 01:05:29,524 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 289 transitions, 3009 flow [2025-01-10 01:05:29,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:05:29,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:29,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:29,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:05:29,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:29,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1685575201, now seen corresponding path program 4 times [2025-01-10 01:05:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:29,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420716123] [2025-01-10 01:05:29,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:05:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:29,531 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:05:29,549 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 59 statements. [2025-01-10 01:05:29,550 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:05:29,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:29,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420716123] [2025-01-10 01:05:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420716123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:29,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:29,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:05:29,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545030533] [2025-01-10 01:05:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:29,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:29,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:29,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:30,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:05:30,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 289 transitions, 3009 flow. Second operand has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:05:30,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:30,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:05:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:31,690 INFO L124 PetriNetUnfolderBase]: 7353/12195 cut-off events. [2025-01-10 01:05:31,690 INFO L125 PetriNetUnfolderBase]: For 70432/71094 co-relation queries the response was YES. [2025-01-10 01:05:31,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54550 conditions, 12195 events. 7353/12195 cut-off events. For 70432/71094 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 84510 event pairs, 1442 based on Foata normal form. 616/12600 useless extension candidates. Maximal degree in co-relation 53432. Up to 6724 conditions per place. [2025-01-10 01:05:31,775 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 310 selfloop transitions, 117 changer transitions 49/499 dead transitions. [2025-01-10 01:05:31,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 499 transitions, 5685 flow [2025-01-10 01:05:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 01:05:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 01:05:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1073 transitions. [2025-01-10 01:05:31,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5109523809523809 [2025-01-10 01:05:31,778 INFO L175 Difference]: Start difference. First operand has 205 places, 289 transitions, 3009 flow. Second operand 28 states and 1073 transitions. [2025-01-10 01:05:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 499 transitions, 5685 flow [2025-01-10 01:05:32,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 499 transitions, 5247 flow, removed 161 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:32,108 INFO L231 Difference]: Finished difference. Result has 241 places, 343 transitions, 3781 flow [2025-01-10 01:05:32,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2681, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3781, PETRI_PLACES=241, PETRI_TRANSITIONS=343} [2025-01-10 01:05:32,109 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 161 predicate places. [2025-01-10 01:05:32,109 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 343 transitions, 3781 flow [2025-01-10 01:05:32,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:05:32,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:32,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:32,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:05:32,109 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:32,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1890701553, now seen corresponding path program 5 times [2025-01-10 01:05:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:32,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085596793] [2025-01-10 01:05:32,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:05:32,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:32,121 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:05:32,152 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:05:32,152 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:05:32,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085596793] [2025-01-10 01:05:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085596793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:32,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195449373] [2025-01-10 01:05:32,488 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:05:32,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:32,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:32,490 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-01-10 01:05:32,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:05:32,539 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:05:32,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:05:32,566 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:05:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:32,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:05:32,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:32,585 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-01-10 01:05:32,872 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 15 treesize of output 7 [2025-01-10 01:05:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:32,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:33,287 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 33 treesize of output 29 [2025-01-10 01:05:33,300 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:05:33,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-01-10 01:05:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195449373] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:33,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-01-10 01:05:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381650567] [2025-01-10 01:05:33,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:33,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:05:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:33,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:05:33,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:05:34,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 01:05:34,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 343 transitions, 3781 flow. Second operand has 26 states, 26 states have (on average 36.92307692307692) internal successors, (960), 26 states have internal predecessors, (960), 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-01-10 01:05:34,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:34,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 01:05:34,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:36,685 INFO L124 PetriNetUnfolderBase]: 7581/12678 cut-off events. [2025-01-10 01:05:36,686 INFO L125 PetriNetUnfolderBase]: For 93370/94191 co-relation queries the response was YES. [2025-01-10 01:05:36,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60021 conditions, 12678 events. 7581/12678 cut-off events. For 93370/94191 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 92899 event pairs, 1803 based on Foata normal form. 666/12912 useless extension candidates. Maximal degree in co-relation 59931. Up to 4565 conditions per place. [2025-01-10 01:05:36,795 INFO L140 encePairwiseOnDemand]: 55/75 looper letters, 307 selfloop transitions, 140 changer transitions 58/556 dead transitions. [2025-01-10 01:05:36,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 556 transitions, 6101 flow [2025-01-10 01:05:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 01:05:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 01:05:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1112 transitions. [2025-01-10 01:05:36,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5702564102564103 [2025-01-10 01:05:36,800 INFO L175 Difference]: Start difference. First operand has 241 places, 343 transitions, 3781 flow. Second operand 26 states and 1112 transitions. [2025-01-10 01:05:36,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 556 transitions, 6101 flow [2025-01-10 01:05:37,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 556 transitions, 5707 flow, removed 191 selfloop flow, removed 9 redundant places. [2025-01-10 01:05:37,396 INFO L231 Difference]: Finished difference. Result has 258 places, 379 transitions, 4251 flow [2025-01-10 01:05:37,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3505, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4251, PETRI_PLACES=258, PETRI_TRANSITIONS=379} [2025-01-10 01:05:37,396 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 178 predicate places. [2025-01-10 01:05:37,396 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 379 transitions, 4251 flow [2025-01-10 01:05:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 36.92307692307692) internal successors, (960), 26 states have internal predecessors, (960), 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-01-10 01:05:37,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:37,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:37,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:05:37,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:37,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:37,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash 69034649, now seen corresponding path program 6 times [2025-01-10 01:05:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344337227] [2025-01-10 01:05:37,603 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:05:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:37,618 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:05:37,639 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-01-10 01:05:37,639 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:05:37,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344337227] [2025-01-10 01:05:37,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344337227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:37,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:37,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:05:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454829911] [2025-01-10 01:05:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:37,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:37,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:37,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:37,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:38,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:05:38,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 379 transitions, 4251 flow. Second operand has 11 states, 11 states have (on average 34.81818181818182) internal successors, (383), 11 states have internal predecessors, (383), 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-01-10 01:05:38,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:38,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:05:38,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:40,853 INFO L124 PetriNetUnfolderBase]: 10219/16646 cut-off events. [2025-01-10 01:05:40,853 INFO L125 PetriNetUnfolderBase]: For 127048/127794 co-relation queries the response was YES. [2025-01-10 01:05:40,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81463 conditions, 16646 events. 10219/16646 cut-off events. For 127048/127794 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 120609 event pairs, 2901 based on Foata normal form. 697/16936 useless extension candidates. Maximal degree in co-relation 81371. Up to 11119 conditions per place. [2025-01-10 01:05:41,026 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 435 selfloop transitions, 154 changer transitions 52/664 dead transitions. [2025-01-10 01:05:41,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 664 transitions, 7958 flow [2025-01-10 01:05:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:05:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 01:05:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1204 transitions. [2025-01-10 01:05:41,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178494623655914 [2025-01-10 01:05:41,033 INFO L175 Difference]: Start difference. First operand has 258 places, 379 transitions, 4251 flow. Second operand 31 states and 1204 transitions. [2025-01-10 01:05:41,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 664 transitions, 7958 flow [2025-01-10 01:05:42,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 664 transitions, 7643 flow, removed 109 selfloop flow, removed 12 redundant places. [2025-01-10 01:05:42,535 INFO L231 Difference]: Finished difference. Result has 289 places, 476 transitions, 5908 flow [2025-01-10 01:05:42,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=4073, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=5908, PETRI_PLACES=289, PETRI_TRANSITIONS=476} [2025-01-10 01:05:42,536 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 209 predicate places. [2025-01-10 01:05:42,536 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 476 transitions, 5908 flow [2025-01-10 01:05:42,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.81818181818182) internal successors, (383), 11 states have internal predecessors, (383), 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-01-10 01:05:42,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:42,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:42,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:05:42,536 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:42,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1986889743, now seen corresponding path program 7 times [2025-01-10 01:05:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992997895] [2025-01-10 01:05:42,537 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:05:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:42,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 01:05:42,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:05:42,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:42,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992997895] [2025-01-10 01:05:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992997895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062900756] [2025-01-10 01:05:43,122 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:05:43,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:43,127 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-01-10 01:05:43,133 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-01-10 01:05:43,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 01:05:43,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:05:43,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:43,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:43,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 01:05:43,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:43,528 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 15 treesize of output 7 [2025-01-10 01:05:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:43,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:43,679 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:05:43,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-01-10 01:05:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062900756] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:43,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 29 [2025-01-10 01:05:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414661644] [2025-01-10 01:05:43,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:43,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 01:05:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:43,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 01:05:43,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:05:44,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 01:05:44,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 476 transitions, 5908 flow. Second operand has 29 states, 29 states have (on average 36.03448275862069) internal successors, (1045), 29 states have internal predecessors, (1045), 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-01-10 01:05:44,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:44,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 01:05:44,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:48,374 INFO L124 PetriNetUnfolderBase]: 9161/15179 cut-off events. [2025-01-10 01:05:48,375 INFO L125 PetriNetUnfolderBase]: For 122071/123159 co-relation queries the response was YES. [2025-01-10 01:05:48,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76872 conditions, 15179 events. 9161/15179 cut-off events. For 122071/123159 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 113495 event pairs, 2006 based on Foata normal form. 697/15312 useless extension candidates. Maximal degree in co-relation 76447. Up to 5485 conditions per place. [2025-01-10 01:05:48,528 INFO L140 encePairwiseOnDemand]: 54/75 looper letters, 383 selfloop transitions, 207 changer transitions 40/675 dead transitions. [2025-01-10 01:05:48,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 675 transitions, 8492 flow [2025-01-10 01:05:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 01:05:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-10 01:05:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1204 transitions. [2025-01-10 01:05:48,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535632183908046 [2025-01-10 01:05:48,531 INFO L175 Difference]: Start difference. First operand has 289 places, 476 transitions, 5908 flow. Second operand 29 states and 1204 transitions. [2025-01-10 01:05:48,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 675 transitions, 8492 flow [2025-01-10 01:05:49,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 675 transitions, 8092 flow, removed 182 selfloop flow, removed 7 redundant places. [2025-01-10 01:05:49,787 INFO L231 Difference]: Finished difference. Result has 311 places, 499 transitions, 6325 flow [2025-01-10 01:05:49,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=5557, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=6325, PETRI_PLACES=311, PETRI_TRANSITIONS=499} [2025-01-10 01:05:49,791 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 231 predicate places. [2025-01-10 01:05:49,792 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 499 transitions, 6325 flow [2025-01-10 01:05:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 36.03448275862069) internal successors, (1045), 29 states have internal predecessors, (1045), 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-01-10 01:05:49,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:49,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:49,800 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-01-10 01:05:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:49,994 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:49,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1502030193, now seen corresponding path program 8 times [2025-01-10 01:05:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:49,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895749009] [2025-01-10 01:05:49,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:50,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:05:50,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-01-10 01:05:50,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:50,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895749009] [2025-01-10 01:05:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895749009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:50,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:50,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:05:50,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603769152] [2025-01-10 01:05:50,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:50,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:50,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:50,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:50,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:05:50,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 499 transitions, 6325 flow. Second operand has 11 states, 11 states have (on average 34.81818181818182) internal successors, (383), 11 states have internal predecessors, (383), 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-01-10 01:05:50,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:50,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:05:50,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:53,677 INFO L124 PetriNetUnfolderBase]: 10204/16732 cut-off events. [2025-01-10 01:05:53,677 INFO L125 PetriNetUnfolderBase]: For 139957/140711 co-relation queries the response was YES. [2025-01-10 01:05:53,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86615 conditions, 16732 events. 10204/16732 cut-off events. For 139957/140711 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 121844 event pairs, 3166 based on Foata normal form. 705/17038 useless extension candidates. Maximal degree in co-relation 86390. Up to 12531 conditions per place. [2025-01-10 01:05:53,857 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 397 selfloop transitions, 193 changer transitions 43/656 dead transitions. [2025-01-10 01:05:53,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 656 transitions, 8854 flow [2025-01-10 01:05:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 01:05:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 01:05:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1014 transitions. [2025-01-10 01:05:53,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-01-10 01:05:53,859 INFO L175 Difference]: Start difference. First operand has 311 places, 499 transitions, 6325 flow. Second operand 26 states and 1014 transitions. [2025-01-10 01:05:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 656 transitions, 8854 flow [2025-01-10 01:05:54,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 656 transitions, 8205 flow, removed 27 selfloop flow, removed 19 redundant places. [2025-01-10 01:05:54,993 INFO L231 Difference]: Finished difference. Result has 318 places, 511 transitions, 6333 flow [2025-01-10 01:05:54,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=5761, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6333, PETRI_PLACES=318, PETRI_TRANSITIONS=511} [2025-01-10 01:05:54,994 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 238 predicate places. [2025-01-10 01:05:54,994 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 511 transitions, 6333 flow [2025-01-10 01:05:54,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.81818181818182) internal successors, (383), 11 states have internal predecessors, (383), 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-01-10 01:05:54,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:54,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:54,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:05:54,999 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:05:55,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1391094737, now seen corresponding path program 9 times [2025-01-10 01:05:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:55,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859268142] [2025-01-10 01:05:55,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:05:55,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:55,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:05:55,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-01-10 01:05:55,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:05:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:05:55,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859268142] [2025-01-10 01:05:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859268142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:05:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606690065] [2025-01-10 01:05:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:55,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:55,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:55,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:55,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:05:55,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 511 transitions, 6333 flow. Second operand has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:05:55,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:55,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:05:55,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:59,484 INFO L124 PetriNetUnfolderBase]: 10939/18015 cut-off events. [2025-01-10 01:05:59,484 INFO L125 PetriNetUnfolderBase]: For 154293/155061 co-relation queries the response was YES. [2025-01-10 01:05:59,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92472 conditions, 18015 events. 10939/18015 cut-off events. For 154293/155061 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 133009 event pairs, 3899 based on Foata normal form. 716/18272 useless extension candidates. Maximal degree in co-relation 92159. Up to 13649 conditions per place. [2025-01-10 01:05:59,673 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 430 selfloop transitions, 218 changer transitions 62/733 dead transitions. [2025-01-10 01:05:59,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 733 transitions, 9681 flow [2025-01-10 01:05:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-10 01:05:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-01-10 01:05:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1342 transitions. [2025-01-10 01:05:59,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5112380952380953 [2025-01-10 01:05:59,678 INFO L175 Difference]: Start difference. First operand has 318 places, 511 transitions, 6333 flow. Second operand 35 states and 1342 transitions. [2025-01-10 01:05:59,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 733 transitions, 9681 flow [2025-01-10 01:06:00,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 733 transitions, 9056 flow, removed 62 selfloop flow, removed 23 redundant places. [2025-01-10 01:06:00,940 INFO L231 Difference]: Finished difference. Result has 343 places, 562 transitions, 7173 flow [2025-01-10 01:06:00,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=5792, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=7173, PETRI_PLACES=343, PETRI_TRANSITIONS=562} [2025-01-10 01:06:00,943 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 263 predicate places. [2025-01-10 01:06:00,943 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 562 transitions, 7173 flow [2025-01-10 01:06:00,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:06:00,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:00,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:00,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:06:00,943 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:06:00,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash -238015381, now seen corresponding path program 10 times [2025-01-10 01:06:00,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:00,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300003499] [2025-01-10 01:06:00,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:06:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:00,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:06:00,973 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 59 statements. [2025-01-10 01:06:00,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:06:00,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:06:01,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:01,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300003499] [2025-01-10 01:06:01,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300003499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:01,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:01,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:06:01,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428828592] [2025-01-10 01:06:01,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:01,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:06:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:01,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:06:01,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:06:01,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:06:01,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 562 transitions, 7173 flow. Second operand has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:06:01,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:01,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:06:01,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:05,883 INFO L124 PetriNetUnfolderBase]: 13842/22894 cut-off events. [2025-01-10 01:06:05,883 INFO L125 PetriNetUnfolderBase]: For 230717/231637 co-relation queries the response was YES. [2025-01-10 01:06:06,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123626 conditions, 22894 events. 13842/22894 cut-off events. For 230717/231637 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 176380 event pairs, 4211 based on Foata normal form. 868/23268 useless extension candidates. Maximal degree in co-relation 122822. Up to 14865 conditions per place. [2025-01-10 01:06:06,341 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 501 selfloop transitions, 306 changer transitions 103/933 dead transitions. [2025-01-10 01:06:06,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 933 transitions, 12964 flow [2025-01-10 01:06:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-10 01:06:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-01-10 01:06:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 1576 transitions. [2025-01-10 01:06:06,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125203252032521 [2025-01-10 01:06:06,347 INFO L175 Difference]: Start difference. First operand has 343 places, 562 transitions, 7173 flow. Second operand 41 states and 1576 transitions. [2025-01-10 01:06:06,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 933 transitions, 12964 flow [2025-01-10 01:06:08,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 933 transitions, 12020 flow, removed 305 selfloop flow, removed 18 redundant places. [2025-01-10 01:06:08,726 INFO L231 Difference]: Finished difference. Result has 380 places, 688 transitions, 9445 flow [2025-01-10 01:06:08,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=6506, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=9445, PETRI_PLACES=380, PETRI_TRANSITIONS=688} [2025-01-10 01:06:08,727 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 300 predicate places. [2025-01-10 01:06:08,727 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 688 transitions, 9445 flow [2025-01-10 01:06:08,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.5) internal successors, (414), 12 states have internal predecessors, (414), 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-01-10 01:06:08,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:08,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:08,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:06:08,728 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:06:08,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash -479740141, now seen corresponding path program 11 times [2025-01-10 01:06:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409180425] [2025-01-10 01:06:08,728 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:06:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:08,735 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:06:08,743 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:06:08,744 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:06:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:09,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:09,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409180425] [2025-01-10 01:06:09,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409180425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:09,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471978638] [2025-01-10 01:06:09,079 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:06:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:09,081 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-01-10 01:06:09,083 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-01-10 01:06:09,129 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:06:09,152 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:06:09,152 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:06:09,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:09,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:06:09,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:09,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:06:09,311 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 15 treesize of output 7 [2025-01-10 01:06:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:09,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:09,799 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 33 treesize of output 29 [2025-01-10 01:06:09,806 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:06:09,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-01-10 01:06:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471978638] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:09,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-01-10 01:06:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802488033] [2025-01-10 01:06:09,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:09,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:06:09,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:09,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:06:09,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:06:10,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 01:06:10,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 688 transitions, 9445 flow. Second operand has 26 states, 26 states have (on average 37.03846153846154) internal successors, (963), 26 states have internal predecessors, (963), 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-01-10 01:06:10,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:10,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 01:06:10,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:15,051 INFO L124 PetriNetUnfolderBase]: 11677/19704 cut-off events. [2025-01-10 01:06:15,051 INFO L125 PetriNetUnfolderBase]: For 240484/242231 co-relation queries the response was YES. [2025-01-10 01:06:15,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113547 conditions, 19704 events. 11677/19704 cut-off events. For 240484/242231 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 156141 event pairs, 2648 based on Foata normal form. 1038/20069 useless extension candidates. Maximal degree in co-relation 113052. Up to 7666 conditions per place. [2025-01-10 01:06:15,263 INFO L140 encePairwiseOnDemand]: 55/75 looper letters, 460 selfloop transitions, 236 changer transitions 45/811 dead transitions. [2025-01-10 01:06:15,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 811 transitions, 11737 flow [2025-01-10 01:06:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:06:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 01:06:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 975 transitions. [2025-01-10 01:06:15,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2025-01-10 01:06:15,265 INFO L175 Difference]: Start difference. First operand has 380 places, 688 transitions, 9445 flow. Second operand 23 states and 975 transitions. [2025-01-10 01:06:15,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 811 transitions, 11737 flow [2025-01-10 01:06:17,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 811 transitions, 10861 flow, removed 366 selfloop flow, removed 15 redundant places. [2025-01-10 01:06:17,871 INFO L231 Difference]: Finished difference. Result has 384 places, 661 transitions, 8778 flow [2025-01-10 01:06:17,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=8599, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=8778, PETRI_PLACES=384, PETRI_TRANSITIONS=661} [2025-01-10 01:06:17,873 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 304 predicate places. [2025-01-10 01:06:17,873 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 661 transitions, 8778 flow [2025-01-10 01:06:17,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 37.03846153846154) internal successors, (963), 26 states have internal predecessors, (963), 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-01-10 01:06:17,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:17,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:17,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:06:18,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:06:18,075 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:06:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash -506676027, now seen corresponding path program 12 times [2025-01-10 01:06:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14664685] [2025-01-10 01:06:18,076 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:06:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:18,081 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 3 equivalence classes. [2025-01-10 01:06:18,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-01-10 01:06:18,088 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:06:18,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:06:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14664685] [2025-01-10 01:06:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14664685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:18,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:18,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:06:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085166080] [2025-01-10 01:06:18,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:18,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:06:18,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:18,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:06:18,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:06:18,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 01:06:18,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 661 transitions, 8778 flow. Second operand has 11 states, 11 states have (on average 34.81818181818182) internal successors, (383), 11 states have internal predecessors, (383), 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-01-10 01:06:18,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:18,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 01:06:18,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:22,919 INFO L124 PetriNetUnfolderBase]: 12931/21378 cut-off events. [2025-01-10 01:06:22,919 INFO L125 PetriNetUnfolderBase]: For 229907/230825 co-relation queries the response was YES. [2025-01-10 01:06:23,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119449 conditions, 21378 events. 12931/21378 cut-off events. For 229907/230825 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 163159 event pairs, 4046 based on Foata normal form. 867/21722 useless extension candidates. Maximal degree in co-relation 119111. Up to 15820 conditions per place. [2025-01-10 01:06:23,235 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 506 selfloop transitions, 254 changer transitions 59/842 dead transitions. [2025-01-10 01:06:23,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 842 transitions, 11951 flow [2025-01-10 01:06:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 01:06:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 01:06:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1012 transitions. [2025-01-10 01:06:23,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.518974358974359 [2025-01-10 01:06:23,238 INFO L175 Difference]: Start difference. First operand has 384 places, 661 transitions, 8778 flow. Second operand 26 states and 1012 transitions. [2025-01-10 01:06:23,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 842 transitions, 11951 flow [2025-01-10 01:06:25,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 842 transitions, 11258 flow, removed 24 selfloop flow, removed 23 redundant places. [2025-01-10 01:06:25,549 INFO L231 Difference]: Finished difference. Result has 392 places, 694 transitions, 9286 flow [2025-01-10 01:06:25,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=8189, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=9286, PETRI_PLACES=392, PETRI_TRANSITIONS=694} [2025-01-10 01:06:25,550 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 312 predicate places. [2025-01-10 01:06:25,550 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 694 transitions, 9286 flow [2025-01-10 01:06:25,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.81818181818182) internal successors, (383), 11 states have internal predecessors, (383), 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-01-10 01:06:25,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:25,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:25,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:06:25,551 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 01:06:25,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1054370937, now seen corresponding path program 13 times [2025-01-10 01:06:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:25,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446345923] [2025-01-10 01:06:25,552 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:06:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:25,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 01:06:25,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:06:25,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:25,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446345923] [2025-01-10 01:06:25,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446345923] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556760339] [2025-01-10 01:06:25,988 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:06:25,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:25,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:25,993 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-01-10 01:06:25,997 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-01-10 01:06:26,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 01:06:26,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:06:26,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:26,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:26,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 01:06:26,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:26,347 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 15 treesize of output 7 [2025-01-10 01:06:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:26,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:26,477 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:06:26,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-01-10 01:06:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:26,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556760339] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:26,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:26,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 30 [2025-01-10 01:06:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925634577] [2025-01-10 01:06:26,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:26,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:06:26,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:26,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:06:26,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:06:27,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 01:06:27,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 694 transitions, 9286 flow. Second operand has 30 states, 30 states have (on average 36.0) internal successors, (1080), 30 states have internal predecessors, (1080), 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-01-10 01:06:27,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:27,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 01:06:27,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand