./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-counter-fun.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/popl20-counter-fun.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 fbe9f324c9eba6beb8c990e3f85f0b00a68548fe05ffdb4e97bc061354d1cdf2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:07:27,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:07:27,710 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:07:27,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:07:27,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:07:27,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:07:27,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:07:27,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:07:27,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:07:27,737 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:07:27,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:07:27,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:07:27,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:07:27,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:07:27,737 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:07:27,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:07:27,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:07:27,739 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:07:27,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:27,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:27,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:07:27,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:07:27,740 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 -> fbe9f324c9eba6beb8c990e3f85f0b00a68548fe05ffdb4e97bc061354d1cdf2 [2025-01-10 01:07:28,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:07:28,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:07:28,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:07:28,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:07:28,035 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:07:28,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2025-01-10 01:07:29,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b523fc212/aa616fe51b584706b87441acdd2da366/FLAGc9fed3b4f [2025-01-10 01:07:29,547 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:07:29,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2025-01-10 01:07:29,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b523fc212/aa616fe51b584706b87441acdd2da366/FLAGc9fed3b4f [2025-01-10 01:07:29,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b523fc212/aa616fe51b584706b87441acdd2da366 [2025-01-10 01:07:29,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:07:29,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:07:29,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:29,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:07:29,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:07:29,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:29" (1/1) ... [2025-01-10 01:07:29,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79273220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:29, skipping insertion in model container [2025-01-10 01:07:29,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:29" (1/1) ... [2025-01-10 01:07:29,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:07:29,975 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:07:29,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:29,986 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:07:30,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:30,027 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:07:30,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30 WrapperNode [2025-01-10 01:07:30,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:30,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:30,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:07:30,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:07:30,034 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:07:30" (1/1) ... [2025-01-10 01:07:30,039 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:07:30" (1/1) ... [2025-01-10 01:07:30,061 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 181 [2025-01-10 01:07:30,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:30,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:07:30,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:07:30,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:07:30,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,093 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:07:30,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:07:30,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:07:30,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:07:30,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:07:30,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (1/1) ... [2025-01-10 01:07:30,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:30,160 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:07:30,161 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:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:07:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:07:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:07:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:07:30,180 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:07:30,268 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:07:30,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:07:30,594 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:07:30,594 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:07:30,958 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:07:30,959 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:07:30,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:30 BoogieIcfgContainer [2025-01-10 01:07:30,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:07:30,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:07:30,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:07:30,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:07:30,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:07:29" (1/3) ... [2025-01-10 01:07:30,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5128e341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:30, skipping insertion in model container [2025-01-10 01:07:30,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:30" (2/3) ... [2025-01-10 01:07:30,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5128e341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:30, skipping insertion in model container [2025-01-10 01:07:30,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:30" (3/3) ... [2025-01-10 01:07:30,968 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2025-01-10 01:07:30,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:07:30,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-fun.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-01-10 01:07:30,982 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:07:31,057 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:07:31,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 122 flow [2025-01-10 01:07:31,111 INFO L124 PetriNetUnfolderBase]: 4/52 cut-off events. [2025-01-10 01:07:31,116 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:07:31,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 4/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 165 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-01-10 01:07:31,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 54 transitions, 122 flow [2025-01-10 01:07:31,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 51 transitions, 114 flow [2025-01-10 01:07:31,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:07:31,135 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;@dcfb9cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:07:31,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-01-10 01:07:31,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:07:31,138 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:07:31,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:07:31,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:31,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:07:31,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:31,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 644352, now seen corresponding path program 1 times [2025-01-10 01:07:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:31,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883996486] [2025-01-10 01:07:31,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:31,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:07:31,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:07:31,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:31,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:31,329 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:07:31,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:31,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883996486] [2025-01-10 01:07:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883996486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:31,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:07:31,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941907427] [2025-01-10 01:07:31,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:31,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:31,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:31,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:31,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:31,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:07:31,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:31,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:31,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:31,576 INFO L124 PetriNetUnfolderBase]: 219/398 cut-off events. [2025-01-10 01:07:31,577 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-10 01:07:31,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 398 events. 219/398 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 1956 event pairs, 182 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 737. Up to 373 conditions per place. [2025-01-10 01:07:31,585 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-01-10 01:07:31,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 142 flow [2025-01-10 01:07:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-01-10 01:07:31,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-01-10 01:07:31,599 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 114 flow. Second operand 3 states and 69 transitions. [2025-01-10 01:07:31,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 142 flow [2025-01-10 01:07:31,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:31,606 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 78 flow [2025-01-10 01:07:31,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-01-10 01:07:31,612 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -18 predicate places. [2025-01-10 01:07:31,614 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 78 flow [2025-01-10 01:07:31,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:07:31,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:31,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:07:31,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:07:31,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:31,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 644353, now seen corresponding path program 1 times [2025-01-10 01:07:31,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:31,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326389366] [2025-01-10 01:07:31,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:31,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:07:31,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:07:31,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:31,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:31,881 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:07:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326389366] [2025-01-10 01:07:31,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326389366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:31,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:31,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:31,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413278530] [2025-01-10 01:07:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:31,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:31,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:31,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:31,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:31,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:31,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:07:31,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:31,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:31,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:32,080 INFO L124 PetriNetUnfolderBase]: 220/401 cut-off events. [2025-01-10 01:07:32,080 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:07:32,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 401 events. 220/401 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 1954 event pairs, 182 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 769. Up to 382 conditions per place. [2025-01-10 01:07:32,085 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-01-10 01:07:32,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 154 flow [2025-01-10 01:07:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-01-10 01:07:32,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2025-01-10 01:07:32,088 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 78 flow. Second operand 4 states and 68 transitions. [2025-01-10 01:07:32,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 154 flow [2025-01-10 01:07:32,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:32,090 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 101 flow [2025-01-10 01:07:32,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2025-01-10 01:07:32,091 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-01-10 01:07:32,091 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 101 flow [2025-01-10 01:07:32,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:07:32,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:32,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:07:32,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:07:32,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:32,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:32,092 INFO L85 PathProgramCache]: Analyzing trace with hash 19976899, now seen corresponding path program 1 times [2025-01-10 01:07:32,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:32,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564110436] [2025-01-10 01:07:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:32,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:07:32,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:07:32,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:32,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:32,297 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:07:32,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564110436] [2025-01-10 01:07:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564110436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:32,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:32,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:32,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632571261] [2025-01-10 01:07:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:32,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:32,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:32,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:32,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:32,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:07:32,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:32,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:32,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:32,464 INFO L124 PetriNetUnfolderBase]: 221/404 cut-off events. [2025-01-10 01:07:32,465 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:07:32,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 404 events. 221/404 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 1984 event pairs, 182 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 790. Up to 381 conditions per place. [2025-01-10 01:07:32,467 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 31 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2025-01-10 01:07:32,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 183 flow [2025-01-10 01:07:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-01-10 01:07:32,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29259259259259257 [2025-01-10 01:07:32,468 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 101 flow. Second operand 5 states and 79 transitions. [2025-01-10 01:07:32,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 183 flow [2025-01-10 01:07:32,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:32,470 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 135 flow [2025-01-10 01:07:32,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2025-01-10 01:07:32,470 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-01-10 01:07:32,470 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 135 flow [2025-01-10 01:07:32,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:07:32,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:32,471 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:07:32,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:07:32,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:32,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash 619244858, now seen corresponding path program 1 times [2025-01-10 01:07:32,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332917504] [2025-01-10 01:07:32,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:32,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:07:32,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:07:32,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:32,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:32,688 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:07:32,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332917504] [2025-01-10 01:07:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332917504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180807074] [2025-01-10 01:07:32,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:32,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:32,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:32,691 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:07:32,693 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:07:32,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:07:32,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:07:32,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:32,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:32,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:07:32,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:32,807 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:07:32,980 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:07:32,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:33,089 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:07:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180807074] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:33,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:07:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995489949] [2025-01-10 01:07:33,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:33,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:33,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:33,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:33,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:33,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 135 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:07:33,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:33,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:33,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:33,456 INFO L124 PetriNetUnfolderBase]: 221/403 cut-off events. [2025-01-10 01:07:33,456 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:07:33,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 403 events. 221/403 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 1970 event pairs, 182 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 800. Up to 381 conditions per place. [2025-01-10 01:07:33,459 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2025-01-10 01:07:33,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 205 flow [2025-01-10 01:07:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-01-10 01:07:33,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25617283950617287 [2025-01-10 01:07:33,463 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 135 flow. Second operand 6 states and 83 transitions. [2025-01-10 01:07:33,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 205 flow [2025-01-10 01:07:33,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:33,465 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 144 flow [2025-01-10 01:07:33,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-01-10 01:07:33,466 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-01-10 01:07:33,466 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 144 flow [2025-01-10 01:07:33,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:07:33,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:33,467 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:07:33,476 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:07:33,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:33,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:33,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2017952489, now seen corresponding path program 1 times [2025-01-10 01:07:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:33,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873147535] [2025-01-10 01:07:33,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:33,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:33,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:07:33,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:07:33,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:33,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:33,877 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:07:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873147535] [2025-01-10 01:07:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873147535] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209122368] [2025-01-10 01:07:33,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:33,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:33,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:33,880 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:07:33,882 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:07:33,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:07:33,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:07:33,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:33,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:33,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:07:33,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:33,959 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:07:34,113 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:07:34,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:34,297 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:07:34,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209122368] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:34,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:34,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:07:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192090944] [2025-01-10 01:07:34,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:34,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:07:34,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:34,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:07:34,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:34,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:34,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 144 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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:07:34,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:34,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:34,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:34,628 INFO L124 PetriNetUnfolderBase]: 221/402 cut-off events. [2025-01-10 01:07:34,628 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:07:34,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 402 events. 221/402 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 1967 event pairs, 182 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 799. Up to 373 conditions per place. [2025-01-10 01:07:34,631 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 24 selfloop transitions, 12 changer transitions 0/39 dead transitions. [2025-01-10 01:07:34,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 212 flow [2025-01-10 01:07:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-01-10 01:07:34,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24603174603174602 [2025-01-10 01:07:34,632 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 144 flow. Second operand 7 states and 93 transitions. [2025-01-10 01:07:34,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 212 flow [2025-01-10 01:07:34,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 178 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-01-10 01:07:34,633 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 130 flow [2025-01-10 01:07:34,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-01-10 01:07:34,634 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-01-10 01:07:34,634 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 130 flow [2025-01-10 01:07:34,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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:07:34,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:34,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:34,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:07:34,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:34,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:34,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1865145649, now seen corresponding path program 1 times [2025-01-10 01:07:34,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:34,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144485479] [2025-01-10 01:07:34,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:34,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:07:34,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:07:34,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:34,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:34,891 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:07:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144485479] [2025-01-10 01:07:34,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144485479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:34,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:34,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830157755] [2025-01-10 01:07:34,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:34,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:34,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:34,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:34,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:34,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:34,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:07:34,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:34,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:34,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:35,038 INFO L124 PetriNetUnfolderBase]: 283/534 cut-off events. [2025-01-10 01:07:35,038 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 01:07:35,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 534 events. 283/534 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2708 event pairs, 213 based on Foata normal form. 15/379 useless extension candidates. Maximal degree in co-relation 699. Up to 389 conditions per place. [2025-01-10 01:07:35,041 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 52 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2025-01-10 01:07:35,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 320 flow [2025-01-10 01:07:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-01-10 01:07:35,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-01-10 01:07:35,042 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 130 flow. Second operand 5 states and 110 transitions. [2025-01-10 01:07:35,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 320 flow [2025-01-10 01:07:35,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 281 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:07:35,044 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 149 flow [2025-01-10 01:07:35,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-01-10 01:07:35,044 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-01-10 01:07:35,044 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 149 flow [2025-01-10 01:07:35,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:07:35,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:35,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:35,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:07:35,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:35,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2088077688, now seen corresponding path program 1 times [2025-01-10 01:07:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096507073] [2025-01-10 01:07:35,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:35,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:35,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:35,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:35,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:35,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:35,198 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:07:35,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096507073] [2025-01-10 01:07:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096507073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817160154] [2025-01-10 01:07:35,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:35,200 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:07:35,202 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:07:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:35,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:35,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:35,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:35,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:35,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:35,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:07:35,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:35,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:07:35,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:35,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:07:35,384 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:07:35,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:35,478 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 61 treesize of output 57 [2025-01-10 01:07:35,550 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:07:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817160154] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:35,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:07:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727976066] [2025-01-10 01:07:35,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:35,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:35,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:35,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:35,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 149 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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:07:35,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:35,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:35,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:36,107 INFO L124 PetriNetUnfolderBase]: 682/1247 cut-off events. [2025-01-10 01:07:36,107 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2025-01-10 01:07:36,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 1247 events. 682/1247 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7109 event pairs, 308 based on Foata normal form. 1/858 useless extension candidates. Maximal degree in co-relation 1904. Up to 385 conditions per place. [2025-01-10 01:07:36,113 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 82 selfloop transitions, 17 changer transitions 1/103 dead transitions. [2025-01-10 01:07:36,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 103 transitions, 518 flow [2025-01-10 01:07:36,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:07:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:07:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2025-01-10 01:07:36,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.360082304526749 [2025-01-10 01:07:36,115 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 149 flow. Second operand 9 states and 175 transitions. [2025-01-10 01:07:36,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 103 transitions, 518 flow [2025-01-10 01:07:36,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:36,117 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 248 flow [2025-01-10 01:07:36,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=248, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-01-10 01:07:36,118 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2025-01-10 01:07:36,118 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 248 flow [2025-01-10 01:07:36,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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:07:36,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:36,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:36,127 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:07:36,322 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:07:36,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:36,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1438697794, now seen corresponding path program 1 times [2025-01-10 01:07:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:36,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927746476] [2025-01-10 01:07:36,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:36,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:36,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:36,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:36,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:36,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927746476] [2025-01-10 01:07:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927746476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:36,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:36,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273525184] [2025-01-10 01:07:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:36,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:36,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:36,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:36,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:36,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:07:36,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:36,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:36,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:36,585 INFO L124 PetriNetUnfolderBase]: 759/1424 cut-off events. [2025-01-10 01:07:36,586 INFO L125 PetriNetUnfolderBase]: For 1349/1349 co-relation queries the response was YES. [2025-01-10 01:07:36,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1424 events. 759/1424 cut-off events. For 1349/1349 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8414 event pairs, 515 based on Foata normal form. 40/1208 useless extension candidates. Maximal degree in co-relation 2765. Up to 1181 conditions per place. [2025-01-10 01:07:36,592 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 54 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2025-01-10 01:07:36,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 424 flow [2025-01-10 01:07:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-01-10 01:07:36,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2025-01-10 01:07:36,593 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 248 flow. Second operand 5 states and 103 transitions. [2025-01-10 01:07:36,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 424 flow [2025-01-10 01:07:36,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 413 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:36,595 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 278 flow [2025-01-10 01:07:36,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2025-01-10 01:07:36,596 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2025-01-10 01:07:36,596 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 278 flow [2025-01-10 01:07:36,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:07:36,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:36,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:36,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:07:36,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:36,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2088077689, now seen corresponding path program 1 times [2025-01-10 01:07:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:36,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172726303] [2025-01-10 01:07:36,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:36,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:36,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:36,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:36,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172726303] [2025-01-10 01:07:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172726303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671362701] [2025-01-10 01:07:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:36,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:36,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:36,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:36,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:36,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:07:36,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:36,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:36,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:36,776 INFO L124 PetriNetUnfolderBase]: 582/1124 cut-off events. [2025-01-10 01:07:36,777 INFO L125 PetriNetUnfolderBase]: For 1278/1278 co-relation queries the response was YES. [2025-01-10 01:07:36,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3120 conditions, 1124 events. 582/1124 cut-off events. For 1278/1278 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6322 event pairs, 447 based on Foata normal form. 60/1012 useless extension candidates. Maximal degree in co-relation 2349. Up to 1024 conditions per place. [2025-01-10 01:07:36,783 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 39 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2025-01-10 01:07:36,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 362 flow [2025-01-10 01:07:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-01-10 01:07:36,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2025-01-10 01:07:36,784 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 278 flow. Second operand 5 states and 70 transitions. [2025-01-10 01:07:36,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 362 flow [2025-01-10 01:07:36,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 349 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:36,787 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 271 flow [2025-01-10 01:07:36,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-01-10 01:07:36,788 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-01-10 01:07:36,788 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 271 flow [2025-01-10 01:07:36,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:07:36,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:36,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:36,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:07:36,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:36,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2088077683, now seen corresponding path program 1 times [2025-01-10 01:07:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:36,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545753296] [2025-01-10 01:07:36,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:36,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:36,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:36,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:36,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:36,835 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:07:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545753296] [2025-01-10 01:07:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545753296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:36,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:36,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893692384] [2025-01-10 01:07:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:36,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:36,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:36,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:36,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:36,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:07:36,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:36,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:36,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:36,939 INFO L124 PetriNetUnfolderBase]: 434/869 cut-off events. [2025-01-10 01:07:36,939 INFO L125 PetriNetUnfolderBase]: For 1073/1073 co-relation queries the response was YES. [2025-01-10 01:07:36,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 869 events. 434/869 cut-off events. For 1073/1073 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4561 event pairs, 329 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 1766. Up to 779 conditions per place. [2025-01-10 01:07:36,944 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 38 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-01-10 01:07:36,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 339 flow [2025-01-10 01:07:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-01-10 01:07:36,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-01-10 01:07:36,946 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 271 flow. Second operand 4 states and 60 transitions. [2025-01-10 01:07:36,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 339 flow [2025-01-10 01:07:36,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 329 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:36,949 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 253 flow [2025-01-10 01:07:36,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2025-01-10 01:07:36,951 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2025-01-10 01:07:36,951 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 253 flow [2025-01-10 01:07:36,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:07:36,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:36,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:36,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:07:36,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:36,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2088077682, now seen corresponding path program 1 times [2025-01-10 01:07:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:36,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560406218] [2025-01-10 01:07:36,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:36,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:36,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:36,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:36,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:36,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:37,064 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:07:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560406218] [2025-01-10 01:07:37,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560406218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:37,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:37,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541007171] [2025-01-10 01:07:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:37,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:37,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:37,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:37,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:37,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:37,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:07:37,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:37,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:37,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:37,176 INFO L124 PetriNetUnfolderBase]: 417/842 cut-off events. [2025-01-10 01:07:37,176 INFO L125 PetriNetUnfolderBase]: For 1079/1079 co-relation queries the response was YES. [2025-01-10 01:07:37,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2237 conditions, 842 events. 417/842 cut-off events. For 1079/1079 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4337 event pairs, 324 based on Foata normal form. 14/809 useless extension candidates. Maximal degree in co-relation 1667. Up to 663 conditions per place. [2025-01-10 01:07:37,180 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 47 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2025-01-10 01:07:37,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 377 flow [2025-01-10 01:07:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-01-10 01:07:37,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2025-01-10 01:07:37,181 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 253 flow. Second operand 4 states and 82 transitions. [2025-01-10 01:07:37,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 377 flow [2025-01-10 01:07:37,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:37,183 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 239 flow [2025-01-10 01:07:37,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-01-10 01:07:37,184 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-01-10 01:07:37,184 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 239 flow [2025-01-10 01:07:37,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:07:37,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:37,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:37,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:07:37,185 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:37,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash -961630638, now seen corresponding path program 1 times [2025-01-10 01:07:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121191096] [2025-01-10 01:07:37,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:37,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:07:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:07:37,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:37,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:37,299 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:07:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:37,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121191096] [2025-01-10 01:07:37,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121191096] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:37,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729164701] [2025-01-10 01:07:37,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:37,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:37,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:37,302 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:07:37,305 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:07:37,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:07:37,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:07:37,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:37,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:37,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:07:37,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:37,449 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:07:37,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:37,505 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 29 treesize of output 25 [2025-01-10 01:07:37,538 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:07:37,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729164701] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:37,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:37,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:07:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773913864] [2025-01-10 01:07:37,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:37,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:07:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:37,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:07:37,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:07:37,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:37,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 239 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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:07:37,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:37,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:37,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:37,885 INFO L124 PetriNetUnfolderBase]: 417/830 cut-off events. [2025-01-10 01:07:37,885 INFO L125 PetriNetUnfolderBase]: For 1176/1176 co-relation queries the response was YES. [2025-01-10 01:07:37,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 830 events. 417/830 cut-off events. For 1176/1176 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4143 event pairs, 107 based on Foata normal form. 2/810 useless extension candidates. Maximal degree in co-relation 1912. Up to 235 conditions per place. [2025-01-10 01:07:37,889 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 60 selfloop transitions, 17 changer transitions 12/92 dead transitions. [2025-01-10 01:07:37,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 594 flow [2025-01-10 01:07:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:07:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:07:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2025-01-10 01:07:37,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2025-01-10 01:07:37,891 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 239 flow. Second operand 8 states and 165 transitions. [2025-01-10 01:07:37,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 594 flow [2025-01-10 01:07:37,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 578 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:37,894 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 332 flow [2025-01-10 01:07:37,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=332, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2025-01-10 01:07:37,894 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2025-01-10 01:07:37,894 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 332 flow [2025-01-10 01:07:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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:07:37,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:37,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:37,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:07:38,095 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,SelfDestructingSolverStorable11 [2025-01-10 01:07:38,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:38,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash -961630632, now seen corresponding path program 1 times [2025-01-10 01:07:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:38,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112677384] [2025-01-10 01:07:38,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:38,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:07:38,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:07:38,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:38,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112677384] [2025-01-10 01:07:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112677384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344690375] [2025-01-10 01:07:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:38,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:38,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:38,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:38,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:38,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:07:38,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:38,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:38,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:38,327 INFO L124 PetriNetUnfolderBase]: 365/727 cut-off events. [2025-01-10 01:07:38,327 INFO L125 PetriNetUnfolderBase]: For 2114/2114 co-relation queries the response was YES. [2025-01-10 01:07:38,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 727 events. 365/727 cut-off events. For 2114/2114 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3559 event pairs, 293 based on Foata normal form. 14/741 useless extension candidates. Maximal degree in co-relation 2275. Up to 610 conditions per place. [2025-01-10 01:07:38,331 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 2 changer transitions 16/61 dead transitions. [2025-01-10 01:07:38,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 470 flow [2025-01-10 01:07:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-01-10 01:07:38,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2025-01-10 01:07:38,333 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 332 flow. Second operand 5 states and 96 transitions. [2025-01-10 01:07:38,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 470 flow [2025-01-10 01:07:38,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 453 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:38,337 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 286 flow [2025-01-10 01:07:38,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-01-10 01:07:38,338 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2025-01-10 01:07:38,338 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 286 flow [2025-01-10 01:07:38,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:07:38,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:38,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:38,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:07:38,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 679543400, now seen corresponding path program 1 times [2025-01-10 01:07:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416296769] [2025-01-10 01:07:38,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:38,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:07:38,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:07:38,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:38,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:07:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416296769] [2025-01-10 01:07:38,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416296769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320418657] [2025-01-10 01:07:38,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:38,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:38,496 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:07:38,498 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:07:38,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:07:38,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:07:38,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:38,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:38,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:07:38,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:07:38,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:07:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320418657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:07:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:07:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439743896] [2025-01-10 01:07:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:38,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:38,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:38,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:07:38,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:38,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:38,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:38,697 INFO L124 PetriNetUnfolderBase]: 245/486 cut-off events. [2025-01-10 01:07:38,697 INFO L125 PetriNetUnfolderBase]: For 1624/1624 co-relation queries the response was YES. [2025-01-10 01:07:38,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 486 events. 245/486 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2158 event pairs, 190 based on Foata normal form. 59/540 useless extension candidates. Maximal degree in co-relation 1513. Up to 431 conditions per place. [2025-01-10 01:07:38,699 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 35 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2025-01-10 01:07:38,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 40 transitions, 312 flow [2025-01-10 01:07:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-01-10 01:07:38,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2025-01-10 01:07:38,700 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 286 flow. Second operand 4 states and 66 transitions. [2025-01-10 01:07:38,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 40 transitions, 312 flow [2025-01-10 01:07:38,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 40 transitions, 281 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-10 01:07:38,702 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 211 flow [2025-01-10 01:07:38,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-01-10 01:07:38,703 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-01-10 01:07:38,703 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 211 flow [2025-01-10 01:07:38,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:38,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:38,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:38,711 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:07:38,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:07:38,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:38,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash 171081105, now seen corresponding path program 1 times [2025-01-10 01:07:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096236764] [2025-01-10 01:07:38,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:38,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:07:38,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:07:38,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:38,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096236764] [2025-01-10 01:07:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096236764] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585830765] [2025-01-10 01:07:39,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:39,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:39,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:39,096 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:07:39,098 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:07:39,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:07:39,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:07:39,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:39,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:39,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:07:39,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:39,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:07:39,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:39,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-01-10 01:07:39,224 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:39,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:07:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:39,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:39,301 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 59 treesize of output 27 [2025-01-10 01:07:39,306 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 6 treesize of output 4 [2025-01-10 01:07:39,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:07:39,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 116 [2025-01-10 01:07:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585830765] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:40,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:07:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518313256] [2025-01-10 01:07:40,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:40,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:40,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:40,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:40,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:40,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:40,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 211 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 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:07:40,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:40,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:40,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:40,333 INFO L124 PetriNetUnfolderBase]: 165/341 cut-off events. [2025-01-10 01:07:40,333 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2025-01-10 01:07:40,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 341 events. 165/341 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1343 event pairs, 122 based on Foata normal form. 47/385 useless extension candidates. Maximal degree in co-relation 864. Up to 293 conditions per place. [2025-01-10 01:07:40,335 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 25 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2025-01-10 01:07:40,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 35 transitions, 234 flow [2025-01-10 01:07:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-01-10 01:07:40,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22839506172839505 [2025-01-10 01:07:40,336 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 211 flow. Second operand 6 states and 74 transitions. [2025-01-10 01:07:40,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 35 transitions, 234 flow [2025-01-10 01:07:40,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 35 transitions, 210 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-01-10 01:07:40,338 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 160 flow [2025-01-10 01:07:40,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2025-01-10 01:07:40,338 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-01-10 01:07:40,338 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 160 flow [2025-01-10 01:07:40,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 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:07:40,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:40,339 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] [2025-01-10 01:07:40,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:40,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:07:40,540 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:40,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash -315793535, now seen corresponding path program 1 times [2025-01-10 01:07:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902441015] [2025-01-10 01:07:40,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:40,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:40,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:40,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:40,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:07:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902441015] [2025-01-10 01:07:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902441015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:40,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:40,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:07:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798747852] [2025-01-10 01:07:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:40,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:40,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:40,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:07:40,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-01-10 01:07:40,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:40,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:40,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-01-10 01:07:40,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:40,753 INFO L124 PetriNetUnfolderBase]: 297/560 cut-off events. [2025-01-10 01:07:40,754 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-01-10 01:07:40,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 560 events. 297/560 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2468 event pairs, 118 based on Foata normal form. 13/533 useless extension candidates. Maximal degree in co-relation 1354. Up to 340 conditions per place. [2025-01-10 01:07:40,757 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 62 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2025-01-10 01:07:40,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 438 flow [2025-01-10 01:07:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-01-10 01:07:40,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3395061728395062 [2025-01-10 01:07:40,758 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 160 flow. Second operand 6 states and 110 transitions. [2025-01-10 01:07:40,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 438 flow [2025-01-10 01:07:40,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 424 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:07:40,760 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 206 flow [2025-01-10 01:07:40,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-01-10 01:07:40,761 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-01-10 01:07:40,761 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 206 flow [2025-01-10 01:07:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:40,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:40,761 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] [2025-01-10 01:07:40,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:07:40,762 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:40,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1520528013, now seen corresponding path program 2 times [2025-01-10 01:07:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956714971] [2025-01-10 01:07:40,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:40,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:40,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:40,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:40,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:07:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956714971] [2025-01-10 01:07:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956714971] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236885482] [2025-01-10 01:07:40,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:40,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:40,817 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:07:40,818 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:07:40,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:40,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:40,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:40,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:40,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:07:40,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:07:40,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:07:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236885482] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:40,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-10 01:07:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818378940] [2025-01-10 01:07:40,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:40,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:07:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:40,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:07:40,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:07:40,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:40,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 206 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:07:40,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:40,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:40,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:41,152 INFO L124 PetriNetUnfolderBase]: 442/772 cut-off events. [2025-01-10 01:07:41,152 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2025-01-10 01:07:41,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 772 events. 442/772 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3337 event pairs, 23 based on Foata normal form. 9/738 useless extension candidates. Maximal degree in co-relation 2465. Up to 157 conditions per place. [2025-01-10 01:07:41,158 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 90 selfloop transitions, 30 changer transitions 0/121 dead transitions. [2025-01-10 01:07:41,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 121 transitions, 798 flow [2025-01-10 01:07:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:07:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:07:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 212 transitions. [2025-01-10 01:07:41,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2804232804232804 [2025-01-10 01:07:41,160 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 206 flow. Second operand 14 states and 212 transitions. [2025-01-10 01:07:41,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 121 transitions, 798 flow [2025-01-10 01:07:41,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 121 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:41,164 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 386 flow [2025-01-10 01:07:41,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=386, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-01-10 01:07:41,165 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2025-01-10 01:07:41,165 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 386 flow [2025-01-10 01:07:41,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:07:41,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:41,166 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] [2025-01-10 01:07:41,172 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:07:41,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:41,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:41,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -166002961, now seen corresponding path program 3 times [2025-01-10 01:07:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697159279] [2025-01-10 01:07:41,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:41,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:41,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:07:41,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:41,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697159279] [2025-01-10 01:07:41,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697159279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:41,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:41,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229578544] [2025-01-10 01:07:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:41,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:41,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:41,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:41,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:41,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:41,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:41,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:41,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:41,549 INFO L124 PetriNetUnfolderBase]: 488/851 cut-off events. [2025-01-10 01:07:41,550 INFO L125 PetriNetUnfolderBase]: For 1849/1849 co-relation queries the response was YES. [2025-01-10 01:07:41,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 851 events. 488/851 cut-off events. For 1849/1849 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3696 event pairs, 139 based on Foata normal form. 2/852 useless extension candidates. Maximal degree in co-relation 3219. Up to 461 conditions per place. [2025-01-10 01:07:41,554 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 88 selfloop transitions, 15 changer transitions 4/108 dead transitions. [2025-01-10 01:07:41,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 108 transitions, 857 flow [2025-01-10 01:07:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-01-10 01:07:41,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2025-01-10 01:07:41,555 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 386 flow. Second operand 5 states and 87 transitions. [2025-01-10 01:07:41,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 108 transitions, 857 flow [2025-01-10 01:07:41,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 108 transitions, 786 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:41,560 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 447 flow [2025-01-10 01:07:41,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2025-01-10 01:07:41,561 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2025-01-10 01:07:41,561 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 447 flow [2025-01-10 01:07:41,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:41,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:41,562 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] [2025-01-10 01:07:41,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:07:41,562 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:41,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2128805518, now seen corresponding path program 1 times [2025-01-10 01:07:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088675162] [2025-01-10 01:07:41,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:41,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:41,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:41,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088675162] [2025-01-10 01:07:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088675162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:41,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:41,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:41,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500470108] [2025-01-10 01:07:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:41,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:41,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:41,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:41,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-01-10 01:07:41,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 447 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:41,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:41,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-01-10 01:07:41,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:41,721 INFO L124 PetriNetUnfolderBase]: 404/737 cut-off events. [2025-01-10 01:07:41,721 INFO L125 PetriNetUnfolderBase]: For 2002/2026 co-relation queries the response was YES. [2025-01-10 01:07:41,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 737 events. 404/737 cut-off events. For 2002/2026 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3403 event pairs, 125 based on Foata normal form. 3/732 useless extension candidates. Maximal degree in co-relation 2890. Up to 472 conditions per place. [2025-01-10 01:07:41,725 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 79 selfloop transitions, 7 changer transitions 7/97 dead transitions. [2025-01-10 01:07:41,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 809 flow [2025-01-10 01:07:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-01-10 01:07:41,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2025-01-10 01:07:41,726 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 447 flow. Second operand 5 states and 94 transitions. [2025-01-10 01:07:41,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 809 flow [2025-01-10 01:07:41,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 770 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:41,731 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 445 flow [2025-01-10 01:07:41,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-01-10 01:07:41,732 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2025-01-10 01:07:41,732 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 445 flow [2025-01-10 01:07:41,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:41,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:41,732 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] [2025-01-10 01:07:41,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:07:41,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:41,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1369681570, now seen corresponding path program 2 times [2025-01-10 01:07:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403018709] [2025-01-10 01:07:41,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:41,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:41,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:41,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:41,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:41,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403018709] [2025-01-10 01:07:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403018709] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636599446] [2025-01-10 01:07:41,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:41,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:41,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:41,778 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:07:41,779 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:07:41,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:41,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:41,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:41,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:41,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:07:41,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:41,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636599446] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:41,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:41,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-10 01:07:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680016031] [2025-01-10 01:07:41,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:41,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:41,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:41,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:07:41,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:41,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 445 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:07:41,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:41,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:41,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:42,075 INFO L124 PetriNetUnfolderBase]: 551/958 cut-off events. [2025-01-10 01:07:42,075 INFO L125 PetriNetUnfolderBase]: For 2291/2291 co-relation queries the response was YES. [2025-01-10 01:07:42,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 958 events. 551/958 cut-off events. For 2291/2291 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4318 event pairs, 33 based on Foata normal form. 12/969 useless extension candidates. Maximal degree in co-relation 3692. Up to 309 conditions per place. [2025-01-10 01:07:42,084 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 107 selfloop transitions, 46 changer transitions 1/155 dead transitions. [2025-01-10 01:07:42,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 155 transitions, 1263 flow [2025-01-10 01:07:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:07:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:07:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2025-01-10 01:07:42,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2760942760942761 [2025-01-10 01:07:42,088 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 445 flow. Second operand 11 states and 164 transitions. [2025-01-10 01:07:42,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 155 transitions, 1263 flow [2025-01-10 01:07:42,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 155 transitions, 1220 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:42,094 INFO L231 Difference]: Finished difference. Result has 89 places, 102 transitions, 799 flow [2025-01-10 01:07:42,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=799, PETRI_PLACES=89, PETRI_TRANSITIONS=102} [2025-01-10 01:07:42,095 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2025-01-10 01:07:42,095 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 102 transitions, 799 flow [2025-01-10 01:07:42,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:07:42,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:42,095 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] [2025-01-10 01:07:42,102 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:07:42,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:42,296 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:42,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:42,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1850140881, now seen corresponding path program 4 times [2025-01-10 01:07:42,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:42,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318313456] [2025-01-10 01:07:42,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:42,303 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:42,306 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-01-10 01:07:42,306 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:07:42,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318313456] [2025-01-10 01:07:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318313456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:42,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:42,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:42,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281267751] [2025-01-10 01:07:42,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:42,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:42,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:42,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:42,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:42,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 102 transitions, 799 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:42,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:42,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:42,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:42,491 INFO L124 PetriNetUnfolderBase]: 649/1112 cut-off events. [2025-01-10 01:07:42,492 INFO L125 PetriNetUnfolderBase]: For 3665/3665 co-relation queries the response was YES. [2025-01-10 01:07:42,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4982 conditions, 1112 events. 649/1112 cut-off events. For 3665/3665 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5156 event pairs, 80 based on Foata normal form. 4/1115 useless extension candidates. Maximal degree in co-relation 4918. Up to 565 conditions per place. [2025-01-10 01:07:42,499 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 119 selfloop transitions, 26 changer transitions 1/147 dead transitions. [2025-01-10 01:07:42,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 147 transitions, 1448 flow [2025-01-10 01:07:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-01-10 01:07:42,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2025-01-10 01:07:42,500 INFO L175 Difference]: Start difference. First operand has 89 places, 102 transitions, 799 flow. Second operand 5 states and 86 transitions. [2025-01-10 01:07:42,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 147 transitions, 1448 flow [2025-01-10 01:07:42,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 147 transitions, 1420 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:42,510 INFO L231 Difference]: Finished difference. Result has 96 places, 113 transitions, 993 flow [2025-01-10 01:07:42,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=993, PETRI_PLACES=96, PETRI_TRANSITIONS=113} [2025-01-10 01:07:42,510 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2025-01-10 01:07:42,510 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 113 transitions, 993 flow [2025-01-10 01:07:42,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:42,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:42,511 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] [2025-01-10 01:07:42,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:07:42,511 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:42,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1782195471, now seen corresponding path program 5 times [2025-01-10 01:07:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:42,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120237048] [2025-01-10 01:07:42,512 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:07:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:42,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:42,525 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:42,525 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:07:42,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120237048] [2025-01-10 01:07:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120237048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561573075] [2025-01-10 01:07:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:42,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:42,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:42,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:42,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-01-10 01:07:42,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 113 transitions, 993 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:42,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:42,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-01-10 01:07:42,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:42,736 INFO L124 PetriNetUnfolderBase]: 576/1033 cut-off events. [2025-01-10 01:07:42,736 INFO L125 PetriNetUnfolderBase]: For 4912/4918 co-relation queries the response was YES. [2025-01-10 01:07:42,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4953 conditions, 1033 events. 576/1033 cut-off events. For 4912/4918 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4999 event pairs, 119 based on Foata normal form. 4/1033 useless extension candidates. Maximal degree in co-relation 4885. Up to 541 conditions per place. [2025-01-10 01:07:42,745 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 106 selfloop transitions, 31 changer transitions 1/154 dead transitions. [2025-01-10 01:07:42,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 154 transitions, 1601 flow [2025-01-10 01:07:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-01-10 01:07:42,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2025-01-10 01:07:42,746 INFO L175 Difference]: Start difference. First operand has 96 places, 113 transitions, 993 flow. Second operand 5 states and 91 transitions. [2025-01-10 01:07:42,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 154 transitions, 1601 flow [2025-01-10 01:07:42,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 154 transitions, 1561 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:42,761 INFO L231 Difference]: Finished difference. Result has 102 places, 121 transitions, 1173 flow [2025-01-10 01:07:42,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1173, PETRI_PLACES=102, PETRI_TRANSITIONS=121} [2025-01-10 01:07:42,762 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2025-01-10 01:07:42,762 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 121 transitions, 1173 flow [2025-01-10 01:07:42,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:42,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:42,762 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] [2025-01-10 01:07:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:07:42,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1085071282, now seen corresponding path program 3 times [2025-01-10 01:07:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101991493] [2025-01-10 01:07:42,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:42,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:42,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:07:42,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:42,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:42,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101991493] [2025-01-10 01:07:42,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101991493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398017332] [2025-01-10 01:07:42,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:42,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:42,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:42,798 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:07:42,800 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:07:42,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:42,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:07:42,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:42,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:42,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:07:42,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:42,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398017332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:42,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:42,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-10 01:07:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772669110] [2025-01-10 01:07:42,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:42,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:07:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:42,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:07:42,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:07:42,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:42,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 121 transitions, 1173 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:07:42,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:42,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:42,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:43,160 INFO L124 PetriNetUnfolderBase]: 685/1180 cut-off events. [2025-01-10 01:07:43,161 INFO L125 PetriNetUnfolderBase]: For 6284/6284 co-relation queries the response was YES. [2025-01-10 01:07:43,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5846 conditions, 1180 events. 685/1180 cut-off events. For 6284/6284 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5627 event pairs, 123 based on Foata normal form. 12/1191 useless extension candidates. Maximal degree in co-relation 5775. Up to 508 conditions per place. [2025-01-10 01:07:43,169 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 126 selfloop transitions, 50 changer transitions 2/179 dead transitions. [2025-01-10 01:07:43,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 179 transitions, 1989 flow [2025-01-10 01:07:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:07:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:07:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2025-01-10 01:07:43,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3045267489711934 [2025-01-10 01:07:43,170 INFO L175 Difference]: Start difference. First operand has 102 places, 121 transitions, 1173 flow. Second operand 9 states and 148 transitions. [2025-01-10 01:07:43,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 179 transitions, 1989 flow [2025-01-10 01:07:43,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 179 transitions, 1923 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:43,185 INFO L231 Difference]: Finished difference. Result has 113 places, 133 transitions, 1401 flow [2025-01-10 01:07:43,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1401, PETRI_PLACES=113, PETRI_TRANSITIONS=133} [2025-01-10 01:07:43,185 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2025-01-10 01:07:43,186 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 133 transitions, 1401 flow [2025-01-10 01:07:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:07:43,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:43,186 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] [2025-01-10 01:07:43,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:43,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:43,390 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:43,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1751765165, now seen corresponding path program 6 times [2025-01-10 01:07:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:43,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219064145] [2025-01-10 01:07:43,391 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:07:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:43,399 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:43,409 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-01-10 01:07:43,409 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:07:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219064145] [2025-01-10 01:07:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219064145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:43,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203844629] [2025-01-10 01:07:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:43,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:43,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:43,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:43,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:43,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 133 transitions, 1401 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:43,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:43,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:43,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:43,623 INFO L124 PetriNetUnfolderBase]: 691/1191 cut-off events. [2025-01-10 01:07:43,623 INFO L125 PetriNetUnfolderBase]: For 6318/6318 co-relation queries the response was YES. [2025-01-10 01:07:43,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6171 conditions, 1191 events. 691/1191 cut-off events. For 6318/6318 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5706 event pairs, 52 based on Foata normal form. 13/1203 useless extension candidates. Maximal degree in co-relation 6095. Up to 354 conditions per place. [2025-01-10 01:07:43,630 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 110 selfloop transitions, 60 changer transitions 0/171 dead transitions. [2025-01-10 01:07:43,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 171 transitions, 1960 flow [2025-01-10 01:07:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2025-01-10 01:07:43,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29894179894179895 [2025-01-10 01:07:43,631 INFO L175 Difference]: Start difference. First operand has 113 places, 133 transitions, 1401 flow. Second operand 7 states and 113 transitions. [2025-01-10 01:07:43,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 171 transitions, 1960 flow [2025-01-10 01:07:43,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 171 transitions, 1946 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:43,647 INFO L231 Difference]: Finished difference. Result has 120 places, 137 transitions, 1600 flow [2025-01-10 01:07:43,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1600, PETRI_PLACES=120, PETRI_TRANSITIONS=137} [2025-01-10 01:07:43,648 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 66 predicate places. [2025-01-10 01:07:43,648 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 137 transitions, 1600 flow [2025-01-10 01:07:43,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:43,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:43,648 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] [2025-01-10 01:07:43,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:07:43,648 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:43,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1259864634, now seen corresponding path program 4 times [2025-01-10 01:07:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458392898] [2025-01-10 01:07:43,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:43,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:43,656 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-01-10 01:07:43,656 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:07:43,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458392898] [2025-01-10 01:07:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458392898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:43,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541841389] [2025-01-10 01:07:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:43,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:43,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:43,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:43,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:43,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 137 transitions, 1600 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:43,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:43,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:43,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:43,860 INFO L124 PetriNetUnfolderBase]: 693/1196 cut-off events. [2025-01-10 01:07:43,861 INFO L125 PetriNetUnfolderBase]: For 8792/8792 co-relation queries the response was YES. [2025-01-10 01:07:43,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6740 conditions, 1196 events. 693/1196 cut-off events. For 8792/8792 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5763 event pairs, 189 based on Foata normal form. 3/1198 useless extension candidates. Maximal degree in co-relation 6662. Up to 805 conditions per place. [2025-01-10 01:07:43,868 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 128 selfloop transitions, 28 changer transitions 5/162 dead transitions. [2025-01-10 01:07:43,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 162 transitions, 2109 flow [2025-01-10 01:07:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-01-10 01:07:43,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3296296296296296 [2025-01-10 01:07:43,869 INFO L175 Difference]: Start difference. First operand has 120 places, 137 transitions, 1600 flow. Second operand 5 states and 89 transitions. [2025-01-10 01:07:43,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 162 transitions, 2109 flow [2025-01-10 01:07:43,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 162 transitions, 2055 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:43,887 INFO L231 Difference]: Finished difference. Result has 121 places, 136 transitions, 1592 flow [2025-01-10 01:07:43,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1592, PETRI_PLACES=121, PETRI_TRANSITIONS=136} [2025-01-10 01:07:43,888 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 67 predicate places. [2025-01-10 01:07:43,888 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 136 transitions, 1592 flow [2025-01-10 01:07:43,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:43,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:43,889 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] [2025-01-10 01:07:43,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:07:43,889 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:43,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash 837151202, now seen corresponding path program 5 times [2025-01-10 01:07:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:43,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414354725] [2025-01-10 01:07:43,889 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:07:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:43,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:43,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:43,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:07:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:43,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414354725] [2025-01-10 01:07:43,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414354725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652079162] [2025-01-10 01:07:43,940 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:07:43,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:43,942 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:07:43,944 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:07:43,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:44,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:44,008 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:07:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:44,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:07:44,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:44,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652079162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:44,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:44,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-10 01:07:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034837610] [2025-01-10 01:07:44,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:44,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:07:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:44,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:07:44,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:07:44,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:44,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 136 transitions, 1592 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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:07:44,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:44,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:44,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:44,300 INFO L124 PetriNetUnfolderBase]: 691/1203 cut-off events. [2025-01-10 01:07:44,300 INFO L125 PetriNetUnfolderBase]: For 8471/8471 co-relation queries the response was YES. [2025-01-10 01:07:44,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1203 events. 691/1203 cut-off events. For 8471/8471 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5861 event pairs, 54 based on Foata normal form. 12/1214 useless extension candidates. Maximal degree in co-relation 6621. Up to 414 conditions per place. [2025-01-10 01:07:44,311 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 123 selfloop transitions, 59 changer transitions 2/185 dead transitions. [2025-01-10 01:07:44,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 185 transitions, 2344 flow [2025-01-10 01:07:44,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:07:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:07:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2025-01-10 01:07:44,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28935185185185186 [2025-01-10 01:07:44,313 INFO L175 Difference]: Start difference. First operand has 121 places, 136 transitions, 1592 flow. Second operand 8 states and 125 transitions. [2025-01-10 01:07:44,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 185 transitions, 2344 flow [2025-01-10 01:07:44,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 185 transitions, 2284 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:44,332 INFO L231 Difference]: Finished difference. Result has 125 places, 143 transitions, 1738 flow [2025-01-10 01:07:44,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1738, PETRI_PLACES=125, PETRI_TRANSITIONS=143} [2025-01-10 01:07:44,332 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 71 predicate places. [2025-01-10 01:07:44,332 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 143 transitions, 1738 flow [2025-01-10 01:07:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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:07:44,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:44,332 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] [2025-01-10 01:07:44,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:07:44,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 01:07:44,533 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:44,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1363966385, now seen corresponding path program 7 times [2025-01-10 01:07:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240594789] [2025-01-10 01:07:44,533 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:07:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:44,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:44,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:44,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:44,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:44,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240594789] [2025-01-10 01:07:44,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240594789] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:44,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157252772] [2025-01-10 01:07:44,593 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:07:44,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:44,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:44,596 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:07:44,597 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:07:44,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:44,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:44,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:44,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:44,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:07:44,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:44,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157252772] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:44,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:44,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-01-10 01:07:44,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056886438] [2025-01-10 01:07:44,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:44,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:44,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:44,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:44,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:44,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:44,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 143 transitions, 1738 flow. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 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:07:44,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:44,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:44,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:44,935 INFO L124 PetriNetUnfolderBase]: 670/1159 cut-off events. [2025-01-10 01:07:44,936 INFO L125 PetriNetUnfolderBase]: For 8705/8705 co-relation queries the response was YES. [2025-01-10 01:07:44,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 1159 events. 670/1159 cut-off events. For 8705/8705 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5527 event pairs, 97 based on Foata normal form. 13/1171 useless extension candidates. Maximal degree in co-relation 6573. Up to 430 conditions per place. [2025-01-10 01:07:44,944 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 123 selfloop transitions, 53 changer transitions 1/178 dead transitions. [2025-01-10 01:07:44,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 178 transitions, 2324 flow [2025-01-10 01:07:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:07:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:07:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2025-01-10 01:07:44,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2025-01-10 01:07:44,945 INFO L175 Difference]: Start difference. First operand has 125 places, 143 transitions, 1738 flow. Second operand 8 states and 136 transitions. [2025-01-10 01:07:44,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 178 transitions, 2324 flow [2025-01-10 01:07:44,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 178 transitions, 2294 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:44,966 INFO L231 Difference]: Finished difference. Result has 129 places, 139 transitions, 1757 flow [2025-01-10 01:07:44,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1757, PETRI_PLACES=129, PETRI_TRANSITIONS=139} [2025-01-10 01:07:44,967 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 75 predicate places. [2025-01-10 01:07:44,967 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 139 transitions, 1757 flow [2025-01-10 01:07:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 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:07:44,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:44,967 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] [2025-01-10 01:07:44,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:45,172 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,SelfDestructingSolverStorable26 [2025-01-10 01:07:45,172 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:45,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash 30764386, now seen corresponding path program 6 times [2025-01-10 01:07:45,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:45,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302243990] [2025-01-10 01:07:45,173 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:07:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:45,180 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-01-10 01:07:45,185 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:45,186 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:07:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302243990] [2025-01-10 01:07:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302243990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:45,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867635951] [2025-01-10 01:07:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:45,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:45,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:45,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:45,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:45,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 139 transitions, 1757 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:45,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:45,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:45,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:45,389 INFO L124 PetriNetUnfolderBase]: 652/1114 cut-off events. [2025-01-10 01:07:45,389 INFO L125 PetriNetUnfolderBase]: For 9589/9589 co-relation queries the response was YES. [2025-01-10 01:07:45,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6702 conditions, 1114 events. 652/1114 cut-off events. For 9589/9589 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5157 event pairs, 87 based on Foata normal form. 3/1116 useless extension candidates. Maximal degree in co-relation 6625. Up to 721 conditions per place. [2025-01-10 01:07:45,395 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 130 selfloop transitions, 25 changer transitions 3/159 dead transitions. [2025-01-10 01:07:45,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 159 transitions, 2213 flow [2025-01-10 01:07:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-01-10 01:07:45,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2025-01-10 01:07:45,397 INFO L175 Difference]: Start difference. First operand has 129 places, 139 transitions, 1757 flow. Second operand 5 states and 83 transitions. [2025-01-10 01:07:45,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 159 transitions, 2213 flow [2025-01-10 01:07:45,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 159 transitions, 2019 flow, removed 22 selfloop flow, removed 10 redundant places. [2025-01-10 01:07:45,414 INFO L231 Difference]: Finished difference. Result has 123 places, 138 transitions, 1608 flow [2025-01-10 01:07:45,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1608, PETRI_PLACES=123, PETRI_TRANSITIONS=138} [2025-01-10 01:07:45,418 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 69 predicate places. [2025-01-10 01:07:45,418 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 138 transitions, 1608 flow [2025-01-10 01:07:45,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:07:45,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:45,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:45,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:07:45,419 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:45,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash -399805263, now seen corresponding path program 1 times [2025-01-10 01:07:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:45,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344468888] [2025-01-10 01:07:45,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:07:45,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:07:45,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:45,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344468888] [2025-01-10 01:07:45,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344468888] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367327879] [2025-01-10 01:07:45,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:45,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:45,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:45,548 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:07:45,550 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:07:45,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:07:45,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:07:45,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:45,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:45,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:07:45,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:45,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:45,728 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 51 treesize of output 19 [2025-01-10 01:07:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367327879] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:45,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:45,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-01-10 01:07:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198743688] [2025-01-10 01:07:45,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:45,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:07:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:45,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:07:45,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:45,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:45,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 138 transitions, 1608 flow. Second operand has 13 states, 13 states have (on average 14.153846153846153) internal successors, (184), 13 states have internal predecessors, (184), 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:07:45,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:45,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:45,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:46,191 INFO L124 PetriNetUnfolderBase]: 1259/2319 cut-off events. [2025-01-10 01:07:46,192 INFO L125 PetriNetUnfolderBase]: For 17696/17782 co-relation queries the response was YES. [2025-01-10 01:07:46,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12955 conditions, 2319 events. 1259/2319 cut-off events. For 17696/17782 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13673 event pairs, 161 based on Foata normal form. 40/2353 useless extension candidates. Maximal degree in co-relation 10334. Up to 719 conditions per place. [2025-01-10 01:07:46,205 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 267 selfloop transitions, 25 changer transitions 16/353 dead transitions. [2025-01-10 01:07:46,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 353 transitions, 4819 flow [2025-01-10 01:07:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:07:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:07:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2025-01-10 01:07:46,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2025-01-10 01:07:46,207 INFO L175 Difference]: Start difference. First operand has 123 places, 138 transitions, 1608 flow. Second operand 10 states and 186 transitions. [2025-01-10 01:07:46,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 353 transitions, 4819 flow [2025-01-10 01:07:46,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 353 transitions, 4641 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 01:07:46,241 INFO L231 Difference]: Finished difference. Result has 129 places, 156 transitions, 1755 flow [2025-01-10 01:07:46,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1755, PETRI_PLACES=129, PETRI_TRANSITIONS=156} [2025-01-10 01:07:46,242 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 75 predicate places. [2025-01-10 01:07:46,242 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 156 transitions, 1755 flow [2025-01-10 01:07:46,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.153846153846153) internal successors, (184), 13 states have internal predecessors, (184), 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:07:46,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:46,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:46,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:46,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:07:46,443 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1464178773, now seen corresponding path program 2 times [2025-01-10 01:07:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:46,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886848414] [2025-01-10 01:07:46,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:46,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:07:46,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:07:46,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:46,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:07:46,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886848414] [2025-01-10 01:07:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886848414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:46,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:46,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605540698] [2025-01-10 01:07:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:46,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:46,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:46,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:46,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-01-10 01:07:46,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 156 transitions, 1755 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:07:46,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:46,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-01-10 01:07:46,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:46,861 INFO L124 PetriNetUnfolderBase]: 1677/3087 cut-off events. [2025-01-10 01:07:46,861 INFO L125 PetriNetUnfolderBase]: For 23092/23192 co-relation queries the response was YES. [2025-01-10 01:07:46,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17476 conditions, 3087 events. 1677/3087 cut-off events. For 23092/23192 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19210 event pairs, 183 based on Foata normal form. 48/3124 useless extension candidates. Maximal degree in co-relation 13568. Up to 1819 conditions per place. [2025-01-10 01:07:46,882 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 181 selfloop transitions, 13 changer transitions 1/240 dead transitions. [2025-01-10 01:07:46,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 240 transitions, 3118 flow [2025-01-10 01:07:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 01:07:46,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2025-01-10 01:07:46,884 INFO L175 Difference]: Start difference. First operand has 129 places, 156 transitions, 1755 flow. Second operand 4 states and 87 transitions. [2025-01-10 01:07:46,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 240 transitions, 3118 flow [2025-01-10 01:07:46,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 240 transitions, 3112 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:46,928 INFO L231 Difference]: Finished difference. Result has 133 places, 164 transitions, 1885 flow [2025-01-10 01:07:46,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1885, PETRI_PLACES=133, PETRI_TRANSITIONS=164} [2025-01-10 01:07:46,928 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 79 predicate places. [2025-01-10 01:07:46,928 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 164 transitions, 1885 flow [2025-01-10 01:07:46,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:07:46,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:46,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:07:46,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 01:07:46,928 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:46,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash 247805726, now seen corresponding path program 3 times [2025-01-10 01:07:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:46,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350291741] [2025-01-10 01:07:46,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:46,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:07:46,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 28 statements. [2025-01-10 01:07:46,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:46,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350291741] [2025-01-10 01:07:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350291741] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21407360] [2025-01-10 01:07:46,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:46,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:46,987 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:46,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:07:47,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:07:47,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 28 statements. [2025-01-10 01:07:47,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:47,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:47,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:07:47,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:47,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:47,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21407360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:47,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:47,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-10 01:07:47,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774184180] [2025-01-10 01:07:47,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:47,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:47,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:47,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:47,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:47,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:47,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 164 transitions, 1885 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 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:07:47,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:47,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:47,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:47,912 INFO L124 PetriNetUnfolderBase]: 3268/5456 cut-off events. [2025-01-10 01:07:47,912 INFO L125 PetriNetUnfolderBase]: For 40163/40163 co-relation queries the response was YES. [2025-01-10 01:07:47,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31714 conditions, 5456 events. 3268/5456 cut-off events. For 40163/40163 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 32402 event pairs, 142 based on Foata normal form. 170/5626 useless extension candidates. Maximal degree in co-relation 25369. Up to 1188 conditions per place. [2025-01-10 01:07:47,949 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 279 selfloop transitions, 107 changer transitions 7/394 dead transitions. [2025-01-10 01:07:47,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 394 transitions, 4973 flow [2025-01-10 01:07:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:07:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:07:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 320 transitions. [2025-01-10 01:07:47,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2821869488536155 [2025-01-10 01:07:47,950 INFO L175 Difference]: Start difference. First operand has 133 places, 164 transitions, 1885 flow. Second operand 21 states and 320 transitions. [2025-01-10 01:07:47,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 394 transitions, 4973 flow [2025-01-10 01:07:48,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 394 transitions, 4933 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:48,026 INFO L231 Difference]: Finished difference. Result has 168 places, 215 transitions, 2933 flow [2025-01-10 01:07:48,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2933, PETRI_PLACES=168, PETRI_TRANSITIONS=215} [2025-01-10 01:07:48,026 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 114 predicate places. [2025-01-10 01:07:48,026 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 215 transitions, 2933 flow [2025-01-10 01:07:48,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 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:07:48,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:48,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:07:48,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:48,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:48,227 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:48,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash -985744606, now seen corresponding path program 4 times [2025-01-10 01:07:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590583638] [2025-01-10 01:07:48,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:48,233 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:07:48,237 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-01-10 01:07:48,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:07:48,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:48,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590583638] [2025-01-10 01:07:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590583638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:48,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454930927] [2025-01-10 01:07:48,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:48,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:48,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:48,279 INFO L229 MonitoredProcess]: Starting monitored process 15 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:07:48,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:07:48,338 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:07:48,353 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-01-10 01:07:48,353 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:07:48,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:48,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:07:48,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:48,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454930927] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:48,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-10 01:07:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250185553] [2025-01-10 01:07:48,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:48,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:07:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:48,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:07:48,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:07:48,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:48,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 215 transitions, 2933 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:07:48,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:48,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:48,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:49,612 INFO L124 PetriNetUnfolderBase]: 4661/7769 cut-off events. [2025-01-10 01:07:49,613 INFO L125 PetriNetUnfolderBase]: For 103493/103493 co-relation queries the response was YES. [2025-01-10 01:07:49,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53466 conditions, 7769 events. 4661/7769 cut-off events. For 103493/103493 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 48660 event pairs, 239 based on Foata normal form. 57/7826 useless extension candidates. Maximal degree in co-relation 50213. Up to 1589 conditions per place. [2025-01-10 01:07:49,684 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 235 selfloop transitions, 182 changer transitions 8/426 dead transitions. [2025-01-10 01:07:49,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 426 transitions, 6356 flow [2025-01-10 01:07:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:07:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:07:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2025-01-10 01:07:49,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28271604938271605 [2025-01-10 01:07:49,685 INFO L175 Difference]: Start difference. First operand has 168 places, 215 transitions, 2933 flow. Second operand 15 states and 229 transitions. [2025-01-10 01:07:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 426 transitions, 6356 flow [2025-01-10 01:07:50,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 426 transitions, 6098 flow, removed 99 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:50,070 INFO L231 Difference]: Finished difference. Result has 187 places, 296 transitions, 4564 flow [2025-01-10 01:07:50,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2806, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4564, PETRI_PLACES=187, PETRI_TRANSITIONS=296} [2025-01-10 01:07:50,071 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 133 predicate places. [2025-01-10 01:07:50,071 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 296 transitions, 4564 flow [2025-01-10 01:07:50,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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:07:50,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:50,071 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:07:50,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:50,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-01-10 01:07:50,271 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:50,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1337052842, now seen corresponding path program 5 times [2025-01-10 01:07:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:50,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080156063] [2025-01-10 01:07:50,272 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:07:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:50,280 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:07:50,297 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:07:50,297 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:07:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080156063] [2025-01-10 01:07:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080156063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838121162] [2025-01-10 01:07:50,351 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:07:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:50,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:50,353 INFO L229 MonitoredProcess]: Starting monitored process 16 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:07:50,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:07:50,408 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:07:50,429 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:07:50,429 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:07:50,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:50,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:07:50,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:50,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838121162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:50,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-10 01:07:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077879535] [2025-01-10 01:07:50,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:50,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:07:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:50,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:07:50,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:07:50,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:50,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 296 transitions, 4564 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:50,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:50,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:50,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:52,091 INFO L124 PetriNetUnfolderBase]: 6313/10495 cut-off events. [2025-01-10 01:07:52,092 INFO L125 PetriNetUnfolderBase]: For 178066/178066 co-relation queries the response was YES. [2025-01-10 01:07:52,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77758 conditions, 10495 events. 6313/10495 cut-off events. For 178066/178066 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 68480 event pairs, 322 based on Foata normal form. 111/10606 useless extension candidates. Maximal degree in co-relation 73407. Up to 2439 conditions per place. [2025-01-10 01:07:52,187 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 257 selfloop transitions, 252 changer transitions 6/516 dead transitions. [2025-01-10 01:07:52,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 516 transitions, 8449 flow [2025-01-10 01:07:52,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:07:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:07:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 250 transitions. [2025-01-10 01:07:52,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28935185185185186 [2025-01-10 01:07:52,188 INFO L175 Difference]: Start difference. First operand has 187 places, 296 transitions, 4564 flow. Second operand 16 states and 250 transitions. [2025-01-10 01:07:52,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 516 transitions, 8449 flow [2025-01-10 01:07:53,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 516 transitions, 8349 flow, removed 35 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:53,095 INFO L231 Difference]: Finished difference. Result has 211 places, 377 transitions, 6825 flow [2025-01-10 01:07:53,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4484, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6825, PETRI_PLACES=211, PETRI_TRANSITIONS=377} [2025-01-10 01:07:53,095 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 157 predicate places. [2025-01-10 01:07:53,096 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 377 transitions, 6825 flow [2025-01-10 01:07:53,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:53,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:53,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:07:53,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:07:53,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:53,296 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1197669894, now seen corresponding path program 6 times [2025-01-10 01:07:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870598827] [2025-01-10 01:07:53,297 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:07:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:53,304 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:07:53,310 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:07:53,310 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:07:53,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:53,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:53,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870598827] [2025-01-10 01:07:53,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870598827] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:53,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953135405] [2025-01-10 01:07:53,367 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:07:53,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:53,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:53,369 INFO L229 MonitoredProcess]: Starting monitored process 17 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:07:53,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:07:53,437 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:07:53,460 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:07:53,460 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:07:53,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:53,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:07:53,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:53,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953135405] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:53,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-10 01:07:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544633270] [2025-01-10 01:07:53,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:53,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:07:53,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:53,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:07:53,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:07:53,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:53,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 377 transitions, 6825 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:53,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:53,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:53,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:55,842 INFO L124 PetriNetUnfolderBase]: 7405/12298 cut-off events. [2025-01-10 01:07:55,851 INFO L125 PetriNetUnfolderBase]: For 292564/292564 co-relation queries the response was YES. [2025-01-10 01:07:55,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102437 conditions, 12298 events. 7405/12298 cut-off events. For 292564/292564 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 82561 event pairs, 295 based on Foata normal form. 80/12378 useless extension candidates. Maximal degree in co-relation 96548. Up to 2186 conditions per place. [2025-01-10 01:07:56,039 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 332 selfloop transitions, 316 changer transitions 5/654 dead transitions. [2025-01-10 01:07:56,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 654 transitions, 12023 flow [2025-01-10 01:07:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:07:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 01:07:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 351 transitions. [2025-01-10 01:07:56,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2025-01-10 01:07:56,042 INFO L175 Difference]: Start difference. First operand has 211 places, 377 transitions, 6825 flow. Second operand 23 states and 351 transitions. [2025-01-10 01:07:56,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 654 transitions, 12023 flow [2025-01-10 01:07:58,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 654 transitions, 11901 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:58,149 INFO L231 Difference]: Finished difference. Result has 243 places, 454 transitions, 9531 flow [2025-01-10 01:07:58,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=6703, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9531, PETRI_PLACES=243, PETRI_TRANSITIONS=454} [2025-01-10 01:07:58,149 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 189 predicate places. [2025-01-10 01:07:58,149 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 454 transitions, 9531 flow [2025-01-10 01:07:58,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:58,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:58,149 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:07:58,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:58,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:58,350 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:07:58,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1289954530, now seen corresponding path program 7 times [2025-01-10 01:07:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045430522] [2025-01-10 01:07:58,351 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:07:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:58,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:07:58,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:07:58,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:58,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:58,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:58,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045430522] [2025-01-10 01:07:58,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045430522] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:58,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403303809] [2025-01-10 01:07:58,419 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:07:58,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:58,422 INFO L229 MonitoredProcess]: Starting monitored process 18 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:07:58,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:07:58,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:07:58,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:07:58,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:58,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:58,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:07:58,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:58,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403303809] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:58,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-10 01:07:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330790273] [2025-01-10 01:07:58,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:58,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:07:58,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:58,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:07:58,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:07:58,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:07:58,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 454 transitions, 9531 flow. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 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:07:58,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:58,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:07:58,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:01,091 INFO L124 PetriNetUnfolderBase]: 7682/12761 cut-off events. [2025-01-10 01:08:01,091 INFO L125 PetriNetUnfolderBase]: For 402321/402321 co-relation queries the response was YES. [2025-01-10 01:08:01,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119537 conditions, 12761 events. 7682/12761 cut-off events. For 402321/402321 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 86431 event pairs, 809 based on Foata normal form. 24/12785 useless extension candidates. Maximal degree in co-relation 113214. Up to 3504 conditions per place. [2025-01-10 01:08:01,286 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 397 selfloop transitions, 214 changer transitions 7/619 dead transitions. [2025-01-10 01:08:01,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 619 transitions, 13016 flow [2025-01-10 01:08:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:08:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:08:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2025-01-10 01:08:01,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3034188034188034 [2025-01-10 01:08:01,287 INFO L175 Difference]: Start difference. First operand has 243 places, 454 transitions, 9531 flow. Second operand 13 states and 213 transitions. [2025-01-10 01:08:01,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 619 transitions, 13016 flow [2025-01-10 01:08:04,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 619 transitions, 12512 flow, removed 209 selfloop flow, removed 6 redundant places. [2025-01-10 01:08:04,968 INFO L231 Difference]: Finished difference. Result has 251 places, 462 transitions, 9684 flow [2025-01-10 01:08:04,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=9051, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9684, PETRI_PLACES=251, PETRI_TRANSITIONS=462} [2025-01-10 01:08:04,969 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 197 predicate places. [2025-01-10 01:08:04,969 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 462 transitions, 9684 flow [2025-01-10 01:08:04,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 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:08:04,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:04,969 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:08:04,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:08:05,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:05,170 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:08:05,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:05,170 INFO L85 PathProgramCache]: Analyzing trace with hash -7623678, now seen corresponding path program 8 times [2025-01-10 01:08:05,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:05,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124372411] [2025-01-10 01:08:05,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:05,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:05,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:08:05,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:08:05,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:05,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124372411] [2025-01-10 01:08:05,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124372411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396572041] [2025-01-10 01:08:05,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:05,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:05,229 INFO L229 MonitoredProcess]: Starting monitored process 19 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:08:05,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:08:05,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:08:05,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:08:05,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:05,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:05,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:05,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:05,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396572041] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:05,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:05,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-01-10 01:08:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610036139] [2025-01-10 01:08:05,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:05,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:08:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:05,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:08:05,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:08:05,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:08:05,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 462 transitions, 9684 flow. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:05,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:05,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:08:05,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:08,079 INFO L124 PetriNetUnfolderBase]: 8882/14667 cut-off events. [2025-01-10 01:08:08,079 INFO L125 PetriNetUnfolderBase]: For 455702/455702 co-relation queries the response was YES. [2025-01-10 01:08:08,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138697 conditions, 14667 events. 8882/14667 cut-off events. For 455702/455702 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 100056 event pairs, 443 based on Foata normal form. 72/14739 useless extension candidates. Maximal degree in co-relation 138107. Up to 3163 conditions per place. [2025-01-10 01:08:08,240 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 356 selfloop transitions, 391 changer transitions 5/753 dead transitions. [2025-01-10 01:08:08,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 753 transitions, 15750 flow [2025-01-10 01:08:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:08:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:08:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 301 transitions. [2025-01-10 01:08:08,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27870370370370373 [2025-01-10 01:08:08,241 INFO L175 Difference]: Start difference. First operand has 251 places, 462 transitions, 9684 flow. Second operand 20 states and 301 transitions. [2025-01-10 01:08:08,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 753 transitions, 15750 flow [2025-01-10 01:08:11,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 753 transitions, 15509 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-01-10 01:08:11,922 INFO L231 Difference]: Finished difference. Result has 276 places, 555 transitions, 13189 flow [2025-01-10 01:08:11,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=9482, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=13189, PETRI_PLACES=276, PETRI_TRANSITIONS=555} [2025-01-10 01:08:11,922 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 222 predicate places. [2025-01-10 01:08:11,922 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 555 transitions, 13189 flow [2025-01-10 01:08:11,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:11,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:11,923 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:08:11,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 01:08:12,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-10 01:08:12,123 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:08:12,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1293372928, now seen corresponding path program 9 times [2025-01-10 01:08:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:12,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157554686] [2025-01-10 01:08:12,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:08:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:12,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:08:12,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 28 statements. [2025-01-10 01:08:12,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:08:12,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:12,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:12,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157554686] [2025-01-10 01:08:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157554686] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855847914] [2025-01-10 01:08:12,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:08:12,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:12,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:12,178 INFO L229 MonitoredProcess]: Starting monitored process 20 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:08:12,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:08:12,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:08:12,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 28 statements. [2025-01-10 01:08:12,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:08:12,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:12,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:12,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:12,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855847914] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:12,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-10 01:08:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414309790] [2025-01-10 01:08:12,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:12,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:08:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:12,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:08:12,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:08:12,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:08:12,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 555 transitions, 13189 flow. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 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:08:12,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:12,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:08:12,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:16,281 INFO L124 PetriNetUnfolderBase]: 9643/15850 cut-off events. [2025-01-10 01:08:16,281 INFO L125 PetriNetUnfolderBase]: For 636477/636477 co-relation queries the response was YES. [2025-01-10 01:08:16,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164301 conditions, 15850 events. 9643/15850 cut-off events. For 636477/636477 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 109290 event pairs, 986 based on Foata normal form. 32/15882 useless extension candidates. Maximal degree in co-relation 162397. Up to 4274 conditions per place. [2025-01-10 01:08:16,549 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 463 selfloop transitions, 247 changer transitions 17/728 dead transitions. [2025-01-10 01:08:16,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 728 transitions, 17350 flow [2025-01-10 01:08:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:08:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:08:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 198 transitions. [2025-01-10 01:08:16,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2025-01-10 01:08:16,551 INFO L175 Difference]: Start difference. First operand has 276 places, 555 transitions, 13189 flow. Second operand 13 states and 198 transitions. [2025-01-10 01:08:16,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 728 transitions, 17350 flow [2025-01-10 01:08:22,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 728 transitions, 16809 flow, removed 226 selfloop flow, removed 5 redundant places. [2025-01-10 01:08:22,794 INFO L231 Difference]: Finished difference. Result has 290 places, 572 transitions, 13907 flow [2025-01-10 01:08:22,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=12800, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=13907, PETRI_PLACES=290, PETRI_TRANSITIONS=572} [2025-01-10 01:08:22,796 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 236 predicate places. [2025-01-10 01:08:22,796 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 572 transitions, 13907 flow [2025-01-10 01:08:22,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 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:08:22,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:22,796 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:08:22,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 01:08:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:22,996 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:08:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 430434869, now seen corresponding path program 10 times [2025-01-10 01:08:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034277215] [2025-01-10 01:08:22,997 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:08:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:23,003 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:08:23,005 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-01-10 01:08:23,006 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:08:23,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034277215] [2025-01-10 01:08:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034277215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973489851] [2025-01-10 01:08:23,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:08:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:23,041 INFO L229 MonitoredProcess]: Starting monitored process 21 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:08:23,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 01:08:23,105 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:08:23,118 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-01-10 01:08:23,118 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:08:23,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:23,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:23,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:23,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973489851] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:23,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-10 01:08:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528125445] [2025-01-10 01:08:23,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:08:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:23,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:08:23,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:08:23,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:08:23,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 572 transitions, 13907 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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:08:23,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:23,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:08:23,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:27,387 INFO L124 PetriNetUnfolderBase]: 10878/17875 cut-off events. [2025-01-10 01:08:27,387 INFO L125 PetriNetUnfolderBase]: For 751331/751331 co-relation queries the response was YES. [2025-01-10 01:08:27,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186895 conditions, 17875 events. 10878/17875 cut-off events. For 751331/751331 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 125970 event pairs, 1918 based on Foata normal form. 330/18205 useless extension candidates. Maximal degree in co-relation 186357. Up to 7985 conditions per place. [2025-01-10 01:08:27,674 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 678 selfloop transitions, 180 changer transitions 0/859 dead transitions. [2025-01-10 01:08:27,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 859 transitions, 20943 flow [2025-01-10 01:08:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:08:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:08:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 310 transitions. [2025-01-10 01:08:27,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28703703703703703 [2025-01-10 01:08:27,679 INFO L175 Difference]: Start difference. First operand has 290 places, 572 transitions, 13907 flow. Second operand 20 states and 310 transitions. [2025-01-10 01:08:27,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 859 transitions, 20943 flow [2025-01-10 01:08:33,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 859 transitions, 20637 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-01-10 01:08:33,768 INFO L231 Difference]: Finished difference. Result has 312 places, 626 transitions, 15990 flow [2025-01-10 01:08:33,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=13521, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=15990, PETRI_PLACES=312, PETRI_TRANSITIONS=626} [2025-01-10 01:08:33,769 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 258 predicate places. [2025-01-10 01:08:33,769 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 626 transitions, 15990 flow [2025-01-10 01:08:33,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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:08:33,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:33,769 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:08:33,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 01:08:33,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-10 01:08:33,970 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:08:33,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -668904070, now seen corresponding path program 11 times [2025-01-10 01:08:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524765893] [2025-01-10 01:08:33,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:08:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:33,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:08:33,995 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:08:33,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:08:33,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:34,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:34,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524765893] [2025-01-10 01:08:34,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524765893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:34,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318740638] [2025-01-10 01:08:34,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:08:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:34,048 INFO L229 MonitoredProcess]: Starting monitored process 22 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:08:34,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 01:08:34,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:08:34,123 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:08:34,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:08:34,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:34,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:34,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:34,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:34,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318740638] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:34,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:34,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-10 01:08:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878605305] [2025-01-10 01:08:34,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:34,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:08:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:34,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:08:34,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:08:34,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:08:34,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 626 transitions, 15990 flow. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 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:08:34,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:34,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:08:34,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:39,096 INFO L124 PetriNetUnfolderBase]: 11905/19499 cut-off events. [2025-01-10 01:08:39,096 INFO L125 PetriNetUnfolderBase]: For 958990/958990 co-relation queries the response was YES. [2025-01-10 01:08:39,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214784 conditions, 19499 events. 11905/19499 cut-off events. For 958990/958990 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 138616 event pairs, 1717 based on Foata normal form. 170/19669 useless extension candidates. Maximal degree in co-relation 212562. Up to 9032 conditions per place. [2025-01-10 01:08:39,421 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 538 selfloop transitions, 300 changer transitions 4/843 dead transitions. [2025-01-10 01:08:39,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 843 transitions, 21510 flow [2025-01-10 01:08:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:08:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:08:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 313 transitions. [2025-01-10 01:08:39,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2898148148148148 [2025-01-10 01:08:39,422 INFO L175 Difference]: Start difference. First operand has 312 places, 626 transitions, 15990 flow. Second operand 20 states and 313 transitions. [2025-01-10 01:08:39,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 843 transitions, 21510 flow [2025-01-10 01:08:49,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 843 transitions, 20771 flow, removed 323 selfloop flow, removed 7 redundant places. [2025-01-10 01:08:49,959 INFO L231 Difference]: Finished difference. Result has 337 places, 663 transitions, 17784 flow [2025-01-10 01:08:49,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=15325, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17784, PETRI_PLACES=337, PETRI_TRANSITIONS=663} [2025-01-10 01:08:49,960 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 283 predicate places. [2025-01-10 01:08:49,960 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 663 transitions, 17784 flow [2025-01-10 01:08:49,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 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:08:49,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:49,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:08:49,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-10 01:08:50,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-10 01:08:50,162 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-01-10 01:08:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1136987345, now seen corresponding path program 12 times [2025-01-10 01:08:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:50,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380917343] [2025-01-10 01:08:50,163 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:08:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:50,169 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:08:50,174 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:08:50,174 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:08:50,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:50,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:50,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380917343] [2025-01-10 01:08:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380917343] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:50,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476198369] [2025-01-10 01:08:50,214 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:08:50,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:50,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:50,216 INFO L229 MonitoredProcess]: Starting monitored process 23 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:08:50,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 01:08:50,353 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-01-10 01:08:50,371 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:08:50,371 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:08:50,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:50,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:08:50,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:50,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:08:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476198369] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:50,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-10 01:08:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658105077] [2025-01-10 01:08:50,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:08:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:50,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:08:50,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:08:50,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-01-10 01:08:50,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 663 transitions, 17784 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:50,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:50,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-01-10 01:08:50,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:56,267 INFO L124 PetriNetUnfolderBase]: 13291/21681 cut-off events. [2025-01-10 01:08:56,267 INFO L125 PetriNetUnfolderBase]: For 1225841/1225841 co-relation queries the response was YES. [2025-01-10 01:08:56,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252337 conditions, 21681 events. 13291/21681 cut-off events. For 1225841/1225841 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 156513 event pairs, 877 based on Foata normal form. 242/21923 useless extension candidates. Maximal degree in co-relation 250274. Up to 8926 conditions per place. [2025-01-10 01:08:56,759 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 734 selfloop transitions, 244 changer transitions 0/979 dead transitions. [2025-01-10 01:08:56,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 979 transitions, 26308 flow [2025-01-10 01:08:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:08:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:08:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 316 transitions. [2025-01-10 01:08:56,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2786596119929453 [2025-01-10 01:08:56,761 INFO L175 Difference]: Start difference. First operand has 337 places, 663 transitions, 17784 flow. Second operand 21 states and 316 transitions. [2025-01-10 01:08:56,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 979 transitions, 26308 flow