./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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-more-mts.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:10:15,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:10:15,408 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:10:15,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:10:15,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:10:15,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:10:15,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:10:15,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:10:15,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:10:15,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:10:15,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:10:15,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:10:15,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:10:15,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:10:15,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:10:15,428 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:10:15,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:15,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:15,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:15,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:10:15,430 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2025-01-10 01:10:15,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:10:15,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:10:15,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:10:15,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:10:15,646 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:10:15,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-01-10 01:10:16,771 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993828d6e/37831b52e500438da0a57e0a2e85e182/FLAG4d9d9b49a [2025-01-10 01:10:16,989 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:10:16,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-01-10 01:10:16,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993828d6e/37831b52e500438da0a57e0a2e85e182/FLAG4d9d9b49a [2025-01-10 01:10:17,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993828d6e/37831b52e500438da0a57e0a2e85e182 [2025-01-10 01:10:17,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:10:17,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:10:17,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:17,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:10:17,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:10:17,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17, skipping insertion in model container [2025-01-10 01:10:17,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:10:17,191 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:10:17,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:17,203 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:10:17,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:17,236 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:10:17,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17 WrapperNode [2025-01-10 01:10:17,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:17,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:17,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:10:17,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:10:17,241 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:10:17" (1/1) ... [2025-01-10 01:10:17,247 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:10:17" (1/1) ... [2025-01-10 01:10:17,268 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 206 [2025-01-10 01:10:17,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:17,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:10:17,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:10:17,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:10:17,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,299 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:10:17,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:10:17,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:10:17,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:10:17,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:10:17,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (1/1) ... [2025-01-10 01:10:17,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:17,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:17,346 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:10:17,353 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:10:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:10:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:10:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:10:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:10:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:10:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:10:17,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:10:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:10:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:10:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:10:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:10:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:10:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:10:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:10:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:10:17,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:10:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:10:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:10:17,371 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:10:17,452 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:10:17,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:10:17,745 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:10:17,745 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:10:18,000 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:10:18,001 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:10:18,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:18 BoogieIcfgContainer [2025-01-10 01:10:18,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:10:18,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:10:18,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:10:18,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:10:18,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:10:17" (1/3) ... [2025-01-10 01:10:18,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33936c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:18, skipping insertion in model container [2025-01-10 01:10:18,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:17" (2/3) ... [2025-01-10 01:10:18,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33936c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:18, skipping insertion in model container [2025-01-10 01:10:18,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:18" (3/3) ... [2025-01-10 01:10:18,011 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-01-10 01:10:18,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:10:18,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-01-10 01:10:18,026 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:10:18,084 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:10:18,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 58 transitions, 137 flow [2025-01-10 01:10:18,144 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2025-01-10 01:10:18,146 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:10:18,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 6/55 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 151 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-01-10 01:10:18,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 58 transitions, 137 flow [2025-01-10 01:10:18,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 54 transitions, 126 flow [2025-01-10 01:10:18,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:10:18,171 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;@7b573ea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:10:18,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-10 01:10:18,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:10:18,178 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:10:18,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:18,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:18,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:18,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 696586, now seen corresponding path program 1 times [2025-01-10 01:10:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:18,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648940310] [2025-01-10 01:10:18,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:18,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:18,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:18,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:18,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:18,362 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:10:18,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:18,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648940310] [2025-01-10 01:10:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648940310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:18,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:18,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:10:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408213174] [2025-01-10 01:10:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:18,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:18,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:18,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:18,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:18,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:18,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:18,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:18,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:18,659 INFO L124 PetriNetUnfolderBase]: 1076/1553 cut-off events. [2025-01-10 01:10:18,659 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-10 01:10:18,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 1553 events. 1076/1553 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6684 event pairs, 723 based on Foata normal form. 1/1389 useless extension candidates. Maximal degree in co-relation 2858. Up to 1475 conditions per place. [2025-01-10 01:10:18,669 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 30 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-01-10 01:10:18,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 176 flow [2025-01-10 01:10:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-01-10 01:10:18,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2025-01-10 01:10:18,679 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 126 flow. Second operand 3 states and 95 transitions. [2025-01-10 01:10:18,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 176 flow [2025-01-10 01:10:18,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:18,689 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 104 flow [2025-01-10 01:10:18,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-01-10 01:10:18,692 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2025-01-10 01:10:18,692 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 104 flow [2025-01-10 01:10:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:18,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:18,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:18,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:10:18,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:18,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash 696587, now seen corresponding path program 1 times [2025-01-10 01:10:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710235704] [2025-01-10 01:10:18,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:18,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:18,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:18,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:18,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:18,922 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:10:18,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:18,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710235704] [2025-01-10 01:10:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710235704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:18,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897309505] [2025-01-10 01:10:18,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:18,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:18,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:18,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:18,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:18,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:18,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:18,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:19,134 INFO L124 PetriNetUnfolderBase]: 1077/1556 cut-off events. [2025-01-10 01:10:19,135 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:10:19,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 1556 events. 1077/1556 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6698 event pairs, 723 based on Foata normal form. 0/1391 useless extension candidates. Maximal degree in co-relation 3052. Up to 1480 conditions per place. [2025-01-10 01:10:19,143 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 32 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-01-10 01:10:19,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 184 flow [2025-01-10 01:10:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-10 01:10:19,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2025-01-10 01:10:19,144 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 104 flow. Second operand 4 states and 113 transitions. [2025-01-10 01:10:19,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 184 flow [2025-01-10 01:10:19,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:19,147 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 127 flow [2025-01-10 01:10:19,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2025-01-10 01:10:19,147 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2025-01-10 01:10:19,147 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 127 flow [2025-01-10 01:10:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:19,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:19,148 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:10:19,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:10:19,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:19,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash 669443033, now seen corresponding path program 1 times [2025-01-10 01:10:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798923600] [2025-01-10 01:10:19,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:19,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:19,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:19,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:19,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:19,422 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:10:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798923600] [2025-01-10 01:10:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798923600] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486502551] [2025-01-10 01:10:19,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:19,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:19,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:19,426 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:10:19,427 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:10:19,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:19,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:19,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:19,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:19,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:10:19,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:19,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:10:19,692 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:10:19,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:19,789 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:10:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486502551] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:19,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:10:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211575837] [2025-01-10 01:10:19,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:19,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:19,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:19,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:19,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:19,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 127 flow. Second operand has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:19,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:19,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:19,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:20,294 INFO L124 PetriNetUnfolderBase]: 1077/1555 cut-off events. [2025-01-10 01:10:20,294 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:10:20,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3081 conditions, 1555 events. 1077/1555 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6705 event pairs, 723 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 3059. Up to 1476 conditions per place. [2025-01-10 01:10:20,300 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 28 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2025-01-10 01:10:20,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 193 flow [2025-01-10 01:10:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-01-10 01:10:20,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43103448275862066 [2025-01-10 01:10:20,303 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 127 flow. Second operand 6 states and 150 transitions. [2025-01-10 01:10:20,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 193 flow [2025-01-10 01:10:20,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:20,304 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 134 flow [2025-01-10 01:10:20,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-01-10 01:10:20,305 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-01-10 01:10:20,305 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 134 flow [2025-01-10 01:10:20,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:20,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:20,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:10:20,314 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:10:20,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:20,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash -718862866, now seen corresponding path program 1 times [2025-01-10 01:10:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:20,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885826732] [2025-01-10 01:10:20,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:20,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:10:20,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:10:20,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:20,597 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:10:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885826732] [2025-01-10 01:10:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885826732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:20,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:20,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833253570] [2025-01-10 01:10:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:20,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:20,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:20,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:20,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2025-01-10 01:10:20,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:20,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:20,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2025-01-10 01:10:20,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:20,727 INFO L124 PetriNetUnfolderBase]: 920/1324 cut-off events. [2025-01-10 01:10:20,728 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:10:20,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 1324 events. 920/1324 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5400 event pairs, 608 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 2616. Up to 1262 conditions per place. [2025-01-10 01:10:20,734 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 31 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-01-10 01:10:20,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 192 flow [2025-01-10 01:10:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-01-10 01:10:20,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2025-01-10 01:10:20,736 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 134 flow. Second operand 4 states and 96 transitions. [2025-01-10 01:10:20,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 192 flow [2025-01-10 01:10:20,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 162 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:10:20,739 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 100 flow [2025-01-10 01:10:20,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2025-01-10 01:10:20,739 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2025-01-10 01:10:20,740 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 100 flow [2025-01-10 01:10:20,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:20,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:20,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:10:20,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:10:20,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:20,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -718862865, now seen corresponding path program 1 times [2025-01-10 01:10:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625427004] [2025-01-10 01:10:20,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:20,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:10:20,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:10:20,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:20,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:20,806 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:10:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625427004] [2025-01-10 01:10:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625427004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:20,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:20,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:20,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954219515] [2025-01-10 01:10:20,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:20,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:20,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:20,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:20,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-01-10 01:10:20,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:20,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:20,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-01-10 01:10:20,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:20,925 INFO L124 PetriNetUnfolderBase]: 919/1323 cut-off events. [2025-01-10 01:10:20,925 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:10:20,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 1323 events. 919/1323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5382 event pairs, 608 based on Foata normal form. 1/1234 useless extension candidates. Maximal degree in co-relation 2608. Up to 1265 conditions per place. [2025-01-10 01:10:20,932 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-01-10 01:10:20,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 162 flow [2025-01-10 01:10:20,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-01-10 01:10:20,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-01-10 01:10:20,933 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 100 flow. Second operand 3 states and 94 transitions. [2025-01-10 01:10:20,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 162 flow [2025-01-10 01:10:20,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:20,936 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 97 flow [2025-01-10 01:10:20,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-01-10 01:10:20,938 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2025-01-10 01:10:20,939 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 97 flow [2025-01-10 01:10:20,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:20,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:20,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:20,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:10:20,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:20,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1848191073, now seen corresponding path program 1 times [2025-01-10 01:10:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686752832] [2025-01-10 01:10:20,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:20,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:10:20,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:10:20,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:20,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686752832] [2025-01-10 01:10:21,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686752832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:21,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246585164] [2025-01-10 01:10:21,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:21,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:21,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:21,103 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:10:21,104 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:10:21,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:10:21,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:10:21,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:21,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:21,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:10:21,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:21,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:21,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:10:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246585164] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:21,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-10 01:10:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259358607] [2025-01-10 01:10:21,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:21,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:10:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:21,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:10:21,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:10:21,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-01-10 01:10:21,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 97 flow. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:21,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:21,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-01-10 01:10:21,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:21,557 INFO L124 PetriNetUnfolderBase]: 1679/2510 cut-off events. [2025-01-10 01:10:21,558 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:10:21,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 2510 events. 1679/2510 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12311 event pairs, 483 based on Foata normal form. 0/2326 useless extension candidates. Maximal degree in co-relation 4834. Up to 1040 conditions per place. [2025-01-10 01:10:21,569 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 63 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2025-01-10 01:10:21,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 315 flow [2025-01-10 01:10:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:10:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:10:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2025-01-10 01:10:21,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49261083743842365 [2025-01-10 01:10:21,572 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 97 flow. Second operand 7 states and 200 transitions. [2025-01-10 01:10:21,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 315 flow [2025-01-10 01:10:21,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:21,573 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 128 flow [2025-01-10 01:10:21,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-01-10 01:10:21,574 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2025-01-10 01:10:21,575 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 128 flow [2025-01-10 01:10:21,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:21,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:21,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:21,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:21,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:21,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:21,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2012881989, now seen corresponding path program 1 times [2025-01-10 01:10:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603276118] [2025-01-10 01:10:21,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:21,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:10:21,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:10:21,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:21,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603276118] [2025-01-10 01:10:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603276118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310578262] [2025-01-10 01:10:21,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:21,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:21,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:21,864 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:10:21,866 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:10:21,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:10:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:10:21,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:21,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:21,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:21,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:21,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:22,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310578262] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:22,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:22,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:10:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118248160] [2025-01-10 01:10:22,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:22,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:10:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:22,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:10:22,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:10:22,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:22,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 128 flow. Second operand has 13 states, 13 states have (on average 20.846153846153847) internal successors, (271), 13 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:22,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:22,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:22,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:22,397 INFO L124 PetriNetUnfolderBase]: 2559/3817 cut-off events. [2025-01-10 01:10:22,398 INFO L125 PetriNetUnfolderBase]: For 1602/1674 co-relation queries the response was YES. [2025-01-10 01:10:22,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 3817 events. 2559/3817 cut-off events. For 1602/1674 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19277 event pairs, 1540 based on Foata normal form. 0/3526 useless extension candidates. Maximal degree in co-relation 5989. Up to 2430 conditions per place. [2025-01-10 01:10:22,461 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 76 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-01-10 01:10:22,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 446 flow [2025-01-10 01:10:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:10:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:10:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2025-01-10 01:10:22,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5147783251231527 [2025-01-10 01:10:22,462 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 128 flow. Second operand 7 states and 209 transitions. [2025-01-10 01:10:22,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 446 flow [2025-01-10 01:10:22,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 440 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:22,464 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 174 flow [2025-01-10 01:10:22,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-01-10 01:10:22,466 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2025-01-10 01:10:22,467 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 174 flow [2025-01-10 01:10:22,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.846153846153847) internal successors, (271), 13 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:22,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:22,467 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:22,473 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:10:22,668 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:10:22,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1251117779, now seen corresponding path program 2 times [2025-01-10 01:10:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664175852] [2025-01-10 01:10:22,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:22,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:10:22,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-01-10 01:10:22,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:10:22,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:22,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664175852] [2025-01-10 01:10:22,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664175852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109840723] [2025-01-10 01:10:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:22,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:22,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:22,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:10:22,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2025-01-10 01:10:22,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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:10:22,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:22,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2025-01-10 01:10:22,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:23,402 INFO L124 PetriNetUnfolderBase]: 4429/6303 cut-off events. [2025-01-10 01:10:23,403 INFO L125 PetriNetUnfolderBase]: For 3208/3354 co-relation queries the response was YES. [2025-01-10 01:10:23,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15415 conditions, 6303 events. 4429/6303 cut-off events. For 3208/3354 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 31269 event pairs, 1966 based on Foata normal form. 0/5598 useless extension candidates. Maximal degree in co-relation 12298. Up to 3995 conditions per place. [2025-01-10 01:10:23,424 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 77 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2025-01-10 01:10:23,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 482 flow [2025-01-10 01:10:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-01-10 01:10:23,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:10:23,425 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 174 flow. Second operand 6 states and 174 transitions. [2025-01-10 01:10:23,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 482 flow [2025-01-10 01:10:23,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:23,428 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 217 flow [2025-01-10 01:10:23,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-01-10 01:10:23,429 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-01-10 01:10:23,429 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 217 flow [2025-01-10 01:10:23,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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:10:23,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:23,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:10:23,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1812598889, now seen corresponding path program 1 times [2025-01-10 01:10:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735554476] [2025-01-10 01:10:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:23,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:10:23,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:10:23,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:23,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:23,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735554476] [2025-01-10 01:10:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735554476] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988296115] [2025-01-10 01:10:23,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:23,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:23,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:23,509 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:10:23,511 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:10:23,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:10:23,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:10:23,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:23,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:23,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:23,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:23,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988296115] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:23,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:10:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369354727] [2025-01-10 01:10:23,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:23,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:10:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:23,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:10:23,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:10:23,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:23,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 217 flow. Second operand has 14 states, 14 states have (on average 21.142857142857142) internal successors, (296), 14 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:23,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:23,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:23,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:24,143 INFO L124 PetriNetUnfolderBase]: 3704/5684 cut-off events. [2025-01-10 01:10:24,144 INFO L125 PetriNetUnfolderBase]: For 4250/4466 co-relation queries the response was YES. [2025-01-10 01:10:24,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14639 conditions, 5684 events. 3704/5684 cut-off events. For 4250/4466 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 30864 event pairs, 2165 based on Foata normal form. 146/5590 useless extension candidates. Maximal degree in co-relation 11805. Up to 4126 conditions per place. [2025-01-10 01:10:24,169 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 81 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2025-01-10 01:10:24,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 547 flow [2025-01-10 01:10:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2025-01-10 01:10:24,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5150862068965517 [2025-01-10 01:10:24,172 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 217 flow. Second operand 8 states and 239 transitions. [2025-01-10 01:10:24,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 547 flow [2025-01-10 01:10:24,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 528 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:24,235 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 263 flow [2025-01-10 01:10:24,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-01-10 01:10:24,237 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-01-10 01:10:24,237 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 263 flow [2025-01-10 01:10:24,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.142857142857142) internal successors, (296), 14 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:24,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:24,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:24,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:24,441 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,SelfDestructingSolverStorable8 [2025-01-10 01:10:24,441 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:24,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1676838645, now seen corresponding path program 1 times [2025-01-10 01:10:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-01-10 01:10:24,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:24,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:10:24,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:10:24,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:24,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:24,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-01-10 01:10:24,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741556431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44848064] [2025-01-10 01:10:24,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:24,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:24,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:24,557 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:10:24,558 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:10:24,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:10:24,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:10:24,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:24,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:24,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:10:24,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:24,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:10:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44848064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:24,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:10:24,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:10:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792437677] [2025-01-10 01:10:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:24,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:24,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:24,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:10:24,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-01-10 01:10:24,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:24,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:24,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-01-10 01:10:24,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:25,173 INFO L124 PetriNetUnfolderBase]: 4316/6645 cut-off events. [2025-01-10 01:10:25,173 INFO L125 PetriNetUnfolderBase]: For 7033/7380 co-relation queries the response was YES. [2025-01-10 01:10:25,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17438 conditions, 6645 events. 4316/6645 cut-off events. For 7033/7380 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 37275 event pairs, 2037 based on Foata normal form. 65/6486 useless extension candidates. Maximal degree in co-relation 13723. Up to 4346 conditions per place. [2025-01-10 01:10:25,199 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 70 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2025-01-10 01:10:25,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 561 flow [2025-01-10 01:10:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:10:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:10:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2025-01-10 01:10:25,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2025-01-10 01:10:25,203 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 263 flow. Second operand 5 states and 150 transitions. [2025-01-10 01:10:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 561 flow [2025-01-10 01:10:25,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 546 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:25,209 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 275 flow [2025-01-10 01:10:25,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2025-01-10 01:10:25,210 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-01-10 01:10:25,210 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 275 flow [2025-01-10 01:10:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:25,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:25,211 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:25,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:25,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:10:25,415 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:25,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash -571402917, now seen corresponding path program 2 times [2025-01-10 01:10:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:25,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726016132] [2025-01-10 01:10:25,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:25,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:10:25,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:10:25,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:25,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:25,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726016132] [2025-01-10 01:10:25,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726016132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641316923] [2025-01-10 01:10:25,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:25,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:25,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:25,620 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:10:25,621 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:10:25,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:10:25,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:10:25,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:25,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:25,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:10:25,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:25,785 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:10:25,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:25,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:10:25,933 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:10:25,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641316923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:25,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:25,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-01-10 01:10:25,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255466510] [2025-01-10 01:10:25,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:25,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:10:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:25,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:10:25,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:10:26,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2025-01-10 01:10:26,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 275 flow. Second operand has 19 states, 19 states have (on average 19.105263157894736) internal successors, (363), 19 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:10:26,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:26,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2025-01-10 01:10:26,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:27,864 INFO L124 PetriNetUnfolderBase]: 6953/9972 cut-off events. [2025-01-10 01:10:27,864 INFO L125 PetriNetUnfolderBase]: For 8775/9381 co-relation queries the response was YES. [2025-01-10 01:10:27,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27921 conditions, 9972 events. 6953/9972 cut-off events. For 8775/9381 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 51333 event pairs, 1029 based on Foata normal form. 486/10450 useless extension candidates. Maximal degree in co-relation 23406. Up to 2162 conditions per place. [2025-01-10 01:10:27,924 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 184 selfloop transitions, 18 changer transitions 0/210 dead transitions. [2025-01-10 01:10:27,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 210 transitions, 1229 flow [2025-01-10 01:10:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:10:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:10:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 414 transitions. [2025-01-10 01:10:27,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098522167487685 [2025-01-10 01:10:27,926 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 275 flow. Second operand 14 states and 414 transitions. [2025-01-10 01:10:27,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 210 transitions, 1229 flow [2025-01-10 01:10:27,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 210 transitions, 1196 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:27,935 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 328 flow [2025-01-10 01:10:27,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=328, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2025-01-10 01:10:27,936 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-01-10 01:10:27,936 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 328 flow [2025-01-10 01:10:27,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.105263157894736) internal successors, (363), 19 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:10:27,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:27,937 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:27,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:10:28,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:10:28,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:28,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash 65432057, now seen corresponding path program 1 times [2025-01-10 01:10:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:28,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441935456] [2025-01-10 01:10:28,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:28,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:10:28,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:10:28,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:28,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441935456] [2025-01-10 01:10:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441935456] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978577278] [2025-01-10 01:10:28,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:28,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:28,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:28,268 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:10:28,271 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:10:28,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:10:28,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:10:28,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:28,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:28,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:10:28,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:28,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978577278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:28,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:10:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068096705] [2025-01-10 01:10:28,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:28,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:10:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:28,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:10:28,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:10:28,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:28,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 328 flow. Second operand has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:28,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:28,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:28,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:29,138 INFO L124 PetriNetUnfolderBase]: 6792/9637 cut-off events. [2025-01-10 01:10:29,139 INFO L125 PetriNetUnfolderBase]: For 15237/15944 co-relation queries the response was YES. [2025-01-10 01:10:29,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28364 conditions, 9637 events. 6792/9637 cut-off events. For 15237/15944 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 47299 event pairs, 4093 based on Foata normal form. 261/9849 useless extension candidates. Maximal degree in co-relation 24876. Up to 8039 conditions per place. [2025-01-10 01:10:29,189 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 85 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-01-10 01:10:29,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 728 flow [2025-01-10 01:10:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2025-01-10 01:10:29,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2025-01-10 01:10:29,193 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 328 flow. Second operand 8 states and 236 transitions. [2025-01-10 01:10:29,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 728 flow [2025-01-10 01:10:29,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 633 flow, removed 9 selfloop flow, removed 11 redundant places. [2025-01-10 01:10:29,207 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 328 flow [2025-01-10 01:10:29,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-01-10 01:10:29,208 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2025-01-10 01:10:29,208 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 328 flow [2025-01-10 01:10:29,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:29,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:29,208 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:29,215 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:10:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:29,409 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:29,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1417102795, now seen corresponding path program 1 times [2025-01-10 01:10:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:29,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-01-10 01:10:29,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:29,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:10:29,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:29,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:29,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:29,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-01-10 01:10:29,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645136654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:29,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062181559] [2025-01-10 01:10:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:29,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:29,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:29,495 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:10:29,499 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:10:29,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:10:29,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:29,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:29,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:29,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:10:29,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:29,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:29,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062181559] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:29,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:29,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 01:10:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777740724] [2025-01-10 01:10:29,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:29,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:10:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:29,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:10:29,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:10:29,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:29,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 328 flow. Second operand has 18 states, 18 states have (on average 21.27777777777778) internal successors, (383), 18 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:29,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:29,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:29,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:30,829 INFO L124 PetriNetUnfolderBase]: 10628/15449 cut-off events. [2025-01-10 01:10:30,832 INFO L125 PetriNetUnfolderBase]: For 18923/19313 co-relation queries the response was YES. [2025-01-10 01:10:30,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45099 conditions, 15449 events. 10628/15449 cut-off events. For 18923/19313 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 86173 event pairs, 4947 based on Foata normal form. 0/15258 useless extension candidates. Maximal degree in co-relation 25176. Up to 7915 conditions per place. [2025-01-10 01:10:30,949 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 134 selfloop transitions, 14 changer transitions 0/157 dead transitions. [2025-01-10 01:10:30,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 157 transitions, 1059 flow [2025-01-10 01:10:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:10:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:10:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 271 transitions. [2025-01-10 01:10:30,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5191570881226054 [2025-01-10 01:10:30,951 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 328 flow. Second operand 9 states and 271 transitions. [2025-01-10 01:10:30,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 157 transitions, 1059 flow [2025-01-10 01:10:30,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 157 transitions, 1040 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:30,986 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 415 flow [2025-01-10 01:10:30,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=415, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2025-01-10 01:10:30,987 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2025-01-10 01:10:30,987 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 415 flow [2025-01-10 01:10:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.27777777777778) internal successors, (383), 18 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:30,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:30,987 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:30,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:10:31,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:31,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -153163833, now seen corresponding path program 2 times [2025-01-10 01:10:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-01-10 01:10:31,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:31,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:10:31,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:10:31,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:31,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:31,421 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:10:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:31,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-01-10 01:10:31,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130544518] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:31,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144162236] [2025-01-10 01:10:31,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:31,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:31,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:31,424 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:10:31,430 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:10:31,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:10:31,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:10:31,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:31,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:31,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:10:31,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:31,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:31,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-01-10 01:10:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144162236] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:31,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2025-01-10 01:10:31,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777187217] [2025-01-10 01:10:31,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:31,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:10:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:31,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:10:31,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:10:32,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:32,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 415 flow. Second operand has 18 states, 18 states have (on average 21.61111111111111) internal successors, (389), 18 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:10:32,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:32,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:32,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:33,667 INFO L124 PetriNetUnfolderBase]: 10112/13952 cut-off events. [2025-01-10 01:10:33,667 INFO L125 PetriNetUnfolderBase]: For 24257/25590 co-relation queries the response was YES. [2025-01-10 01:10:33,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43662 conditions, 13952 events. 10112/13952 cut-off events. For 24257/25590 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 69909 event pairs, 1895 based on Foata normal form. 686/14613 useless extension candidates. Maximal degree in co-relation 32936. Up to 4458 conditions per place. [2025-01-10 01:10:33,747 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 140 selfloop transitions, 14 changer transitions 0/164 dead transitions. [2025-01-10 01:10:33,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 164 transitions, 1245 flow [2025-01-10 01:10:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:10:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:10:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-01-10 01:10:33,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5270935960591133 [2025-01-10 01:10:33,749 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 415 flow. Second operand 7 states and 214 transitions. [2025-01-10 01:10:33,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 164 transitions, 1245 flow [2025-01-10 01:10:33,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 164 transitions, 1224 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:33,835 INFO L231 Difference]: Finished difference. Result has 93 places, 73 transitions, 442 flow [2025-01-10 01:10:33,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2025-01-10 01:10:33,835 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 35 predicate places. [2025-01-10 01:10:33,838 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 442 flow [2025-01-10 01:10:33,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.61111111111111) internal successors, (389), 18 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:10:33,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:33,839 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:33,848 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:10:34,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:34,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:34,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash 396359207, now seen corresponding path program 2 times [2025-01-10 01:10:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084062625] [2025-01-10 01:10:34,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:34,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:10:34,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:10:34,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:34,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:10:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084062625] [2025-01-10 01:10:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084062625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318191459] [2025-01-10 01:10:34,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:34,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:34,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:34,332 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:10:34,333 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:10:34,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:10:34,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:10:34,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:34,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:34,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:10:34,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:34,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:34,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:10:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318191459] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:34,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:34,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2025-01-10 01:10:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098690] [2025-01-10 01:10:34,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:34,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:10:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:34,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:10:34,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:10:34,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2025-01-10 01:10:34,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 442 flow. Second operand has 21 states, 21 states have (on average 19.38095238095238) internal successors, (407), 21 states have internal predecessors, (407), 0 states have call successors, (0), 0 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:10:34,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:34,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2025-01-10 01:10:34,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:36,644 INFO L124 PetriNetUnfolderBase]: 11631/16243 cut-off events. [2025-01-10 01:10:36,645 INFO L125 PetriNetUnfolderBase]: For 33823/34478 co-relation queries the response was YES. [2025-01-10 01:10:36,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52872 conditions, 16243 events. 11631/16243 cut-off events. For 33823/34478 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 85169 event pairs, 1357 based on Foata normal form. 640/16547 useless extension candidates. Maximal degree in co-relation 34440. Up to 2716 conditions per place. [2025-01-10 01:10:36,827 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 238 selfloop transitions, 21 changer transitions 0/267 dead transitions. [2025-01-10 01:10:36,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 267 transitions, 1909 flow [2025-01-10 01:10:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:10:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:10:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 475 transitions. [2025-01-10 01:10:36,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5118534482758621 [2025-01-10 01:10:36,831 INFO L175 Difference]: Start difference. First operand has 93 places, 73 transitions, 442 flow. Second operand 16 states and 475 transitions. [2025-01-10 01:10:36,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 267 transitions, 1909 flow [2025-01-10 01:10:36,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 267 transitions, 1777 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:36,887 INFO L231 Difference]: Finished difference. Result has 102 places, 74 transitions, 466 flow [2025-01-10 01:10:36,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=466, PETRI_PLACES=102, PETRI_TRANSITIONS=74} [2025-01-10 01:10:36,888 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 44 predicate places. [2025-01-10 01:10:36,888 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 74 transitions, 466 flow [2025-01-10 01:10:36,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 19.38095238095238) internal successors, (407), 21 states have internal predecessors, (407), 0 states have call successors, (0), 0 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:10:36,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:36,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] [2025-01-10 01:10:36,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:37,093 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,SelfDestructingSolverStorable14 [2025-01-10 01:10:37,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1561058658, now seen corresponding path program 1 times [2025-01-10 01:10:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:37,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-01-10 01:10:37,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:37,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:10:37,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:10:37,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:37,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:37,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:37,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-01-10 01:10:37,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593780511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:37,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:37,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567623275] [2025-01-10 01:10:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:37,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:37,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:37,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:37,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-01-10 01:10:37,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 74 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:37,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:37,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-01-10 01:10:37,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:38,161 INFO L124 PetriNetUnfolderBase]: 10276/15161 cut-off events. [2025-01-10 01:10:38,161 INFO L125 PetriNetUnfolderBase]: For 30666/31353 co-relation queries the response was YES. [2025-01-10 01:10:38,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48264 conditions, 15161 events. 10276/15161 cut-off events. For 30666/31353 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 85209 event pairs, 2064 based on Foata normal form. 3/15135 useless extension candidates. Maximal degree in co-relation 37569. Up to 11852 conditions per place. [2025-01-10 01:10:38,255 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 89 selfloop transitions, 6 changer transitions 1/107 dead transitions. [2025-01-10 01:10:38,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 846 flow [2025-01-10 01:10:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-10 01:10:38,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2025-01-10 01:10:38,256 INFO L175 Difference]: Start difference. First operand has 102 places, 74 transitions, 466 flow. Second operand 3 states and 114 transitions. [2025-01-10 01:10:38,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 846 flow [2025-01-10 01:10:38,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 107 transitions, 737 flow, removed 15 selfloop flow, removed 15 redundant places. [2025-01-10 01:10:38,298 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 448 flow [2025-01-10 01:10:38,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-01-10 01:10:38,299 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-01-10 01:10:38,299 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 448 flow [2025-01-10 01:10:38,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:38,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:38,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:38,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:10:38,300 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:38,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2009953500, now seen corresponding path program 1 times [2025-01-10 01:10:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:38,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632085897] [2025-01-10 01:10:38,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:38,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:10:38,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:10:38,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:38,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:38,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632085897] [2025-01-10 01:10:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632085897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595307782] [2025-01-10 01:10:38,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:38,365 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:10:38,368 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:10:38,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:10:38,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:10:38,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:38,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:38,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:10:38,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:38,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595307782] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:38,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:10:38,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-10 01:10:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292377665] [2025-01-10 01:10:38,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:38,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:10:38,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:38,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:10:38,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:10:38,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:38,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 448 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:38,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:38,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:38,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:39,815 INFO L124 PetriNetUnfolderBase]: 11955/17159 cut-off events. [2025-01-10 01:10:39,816 INFO L125 PetriNetUnfolderBase]: For 27876/28934 co-relation queries the response was YES. [2025-01-10 01:10:39,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52308 conditions, 17159 events. 11955/17159 cut-off events. For 27876/28934 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 97189 event pairs, 2088 based on Foata normal form. 318/17225 useless extension candidates. Maximal degree in co-relation 40253. Up to 11078 conditions per place. [2025-01-10 01:10:39,930 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 92 selfloop transitions, 12 changer transitions 0/112 dead transitions. [2025-01-10 01:10:39,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 112 transitions, 839 flow [2025-01-10 01:10:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:10:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:10:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-01-10 01:10:39,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2025-01-10 01:10:39,931 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 448 flow. Second operand 5 states and 144 transitions. [2025-01-10 01:10:39,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 112 transitions, 839 flow [2025-01-10 01:10:39,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 112 transitions, 828 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:39,969 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 472 flow [2025-01-10 01:10:39,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=472, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2025-01-10 01:10:39,969 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2025-01-10 01:10:39,969 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 472 flow [2025-01-10 01:10:39,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:39,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:39,970 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:10:39,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:10:40,170 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,SelfDestructingSolverStorable16 [2025-01-10 01:10:40,171 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1312846, now seen corresponding path program 1 times [2025-01-10 01:10:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886362035] [2025-01-10 01:10:40,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:40,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:10:40,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:10:40,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:40,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:40,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:40,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886362035] [2025-01-10 01:10:40,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886362035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:40,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:40,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:40,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181002376] [2025-01-10 01:10:40,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:40,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:10:40,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:40,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:10:40,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:10:40,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-01-10 01:10:40,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 472 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:40,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:40,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-01-10 01:10:40,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:41,384 INFO L124 PetriNetUnfolderBase]: 13214/19335 cut-off events. [2025-01-10 01:10:41,384 INFO L125 PetriNetUnfolderBase]: For 46580/47540 co-relation queries the response was YES. [2025-01-10 01:10:41,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61539 conditions, 19335 events. 13214/19335 cut-off events. For 46580/47540 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 114326 event pairs, 2300 based on Foata normal form. 15/19276 useless extension candidates. Maximal degree in co-relation 49358. Up to 10420 conditions per place. [2025-01-10 01:10:41,556 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 144 selfloop transitions, 31 changer transitions 2/189 dead transitions. [2025-01-10 01:10:41,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 189 transitions, 1414 flow [2025-01-10 01:10:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2025-01-10 01:10:41,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.646551724137931 [2025-01-10 01:10:41,559 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 472 flow. Second operand 6 states and 225 transitions. [2025-01-10 01:10:41,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 189 transitions, 1414 flow [2025-01-10 01:10:41,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 189 transitions, 1383 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:41,648 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 751 flow [2025-01-10 01:10:41,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=751, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2025-01-10 01:10:41,648 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 39 predicate places. [2025-01-10 01:10:41,649 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 751 flow [2025-01-10 01:10:41,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:41,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:41,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:41,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:10:41,649 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1841836367, now seen corresponding path program 1 times [2025-01-10 01:10:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670902545] [2025-01-10 01:10:41,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:41,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:10:41,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:41,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:41,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:41,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670902545] [2025-01-10 01:10:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670902545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:41,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:41,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824407986] [2025-01-10 01:10:41,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:41,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:41,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:41,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:41,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:41,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 751 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:41,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:41,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:41,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:42,840 INFO L124 PetriNetUnfolderBase]: 14883/20827 cut-off events. [2025-01-10 01:10:42,841 INFO L125 PetriNetUnfolderBase]: For 54366/55534 co-relation queries the response was YES. [2025-01-10 01:10:42,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71614 conditions, 20827 events. 14883/20827 cut-off events. For 54366/55534 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 115894 event pairs, 3614 based on Foata normal form. 755/21162 useless extension candidates. Maximal degree in co-relation 56439. Up to 11242 conditions per place. [2025-01-10 01:10:42,996 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 142 selfloop transitions, 9 changer transitions 0/161 dead transitions. [2025-01-10 01:10:42,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 161 transitions, 1520 flow [2025-01-10 01:10:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-01-10 01:10:42,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-01-10 01:10:42,997 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 751 flow. Second operand 4 states and 124 transitions. [2025-01-10 01:10:42,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 161 transitions, 1520 flow [2025-01-10 01:10:43,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 161 transitions, 1465 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:43,062 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 725 flow [2025-01-10 01:10:43,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=725, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2025-01-10 01:10:43,062 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 41 predicate places. [2025-01-10 01:10:43,062 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 725 flow [2025-01-10 01:10:43,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:43,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:43,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:43,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:10:43,063 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:43,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1306369306, now seen corresponding path program 1 times [2025-01-10 01:10:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-01-10 01:10:43,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:10:43,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:10:43,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:43,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:43,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-01-10 01:10:43,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521402764] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:43,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723098854] [2025-01-10 01:10:43,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:43,444 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:10:43,446 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:10:43,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:10:43,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:10:43,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:10:43,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:43,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:10:43,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2025-01-10 01:10:43,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-01-10 01:10:43,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-10 01:10:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:43,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:44,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2025-01-10 01:10:44,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2025-01-10 01:10:44,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 169 [2025-01-10 01:10:44,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:10:44,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2025-01-10 01:10:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723098854] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:51,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-01-10 01:10:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547990942] [2025-01-10 01:10:51,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:51,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 01:10:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:51,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 01:10:51,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:10:53,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:10:53,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 725 flow. Second operand has 29 states, 29 states have (on average 21.586206896551722) internal successors, (626), 29 states have internal predecessors, (626), 0 states have call successors, (0), 0 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:10:53,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:53,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:10:53,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:55,561 INFO L124 PetriNetUnfolderBase]: 17237/24865 cut-off events. [2025-01-10 01:10:55,561 INFO L125 PetriNetUnfolderBase]: For 63787/65321 co-relation queries the response was YES. [2025-01-10 01:10:55,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84959 conditions, 24865 events. 17237/24865 cut-off events. For 63787/65321 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 145929 event pairs, 1651 based on Foata normal form. 1/24846 useless extension candidates. Maximal degree in co-relation 63964. Up to 16432 conditions per place. [2025-01-10 01:10:55,686 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 159 selfloop transitions, 50 changer transitions 47/267 dead transitions. [2025-01-10 01:10:55,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 267 transitions, 2097 flow [2025-01-10 01:10:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:10:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:10:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 541 transitions. [2025-01-10 01:10:55,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909255898366606 [2025-01-10 01:10:55,688 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 725 flow. Second operand 19 states and 541 transitions. [2025-01-10 01:10:55,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 267 transitions, 2097 flow [2025-01-10 01:10:55,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 267 transitions, 2053 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:55,766 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 1094 flow [2025-01-10 01:10:55,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1094, PETRI_PLACES=124, PETRI_TRANSITIONS=131} [2025-01-10 01:10:55,767 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 66 predicate places. [2025-01-10 01:10:55,767 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 1094 flow [2025-01-10 01:10:55,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 21.586206896551722) internal successors, (626), 29 states have internal predecessors, (626), 0 states have call successors, (0), 0 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:10:55,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:55,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:55,773 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:10:55,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:55,968 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:10:55,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash -622926258, now seen corresponding path program 2 times [2025-01-10 01:10:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621926463] [2025-01-10 01:10:55,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:55,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:10:55,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:10:55,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:55,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:56,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621926463] [2025-01-10 01:10:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621926463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951567122] [2025-01-10 01:10:56,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:56,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:56,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:56,358 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:10:56,361 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:10:56,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:10:56,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:10:56,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:56,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:56,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 01:10:56,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:56,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:10:56,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 01:10:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:56,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:56,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2025-01-10 01:10:56,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2025-01-10 01:10:57,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 157 [2025-01-10 01:10:57,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:10:57,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 218 [2025-01-10 01:11:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951567122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:02,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-10 01:11:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170572700] [2025-01-10 01:11:02,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:02,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:11:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:02,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:11:02,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:11:03,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:11:03,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 131 transitions, 1094 flow. Second operand has 30 states, 30 states have (on average 21.5) internal successors, (645), 30 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:03,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:03,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:11:03,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:10,013 INFO L124 PetriNetUnfolderBase]: 21996/32517 cut-off events. [2025-01-10 01:11:10,013 INFO L125 PetriNetUnfolderBase]: For 111710/113734 co-relation queries the response was YES. [2025-01-10 01:11:10,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120391 conditions, 32517 events. 21996/32517 cut-off events. For 111710/113734 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 208684 event pairs, 2418 based on Foata normal form. 153/32667 useless extension candidates. Maximal degree in co-relation 120349. Up to 21645 conditions per place. [2025-01-10 01:11:10,335 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 336 selfloop transitions, 300 changer transitions 32/679 dead transitions. [2025-01-10 01:11:10,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 679 transitions, 6229 flow [2025-01-10 01:11:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-10 01:11:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-01-10 01:11:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 1765 transitions. [2025-01-10 01:11:10,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4541945445187854 [2025-01-10 01:11:10,338 INFO L175 Difference]: Start difference. First operand has 124 places, 131 transitions, 1094 flow. Second operand 67 states and 1765 transitions. [2025-01-10 01:11:10,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 679 transitions, 6229 flow [2025-01-10 01:11:10,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 679 transitions, 6023 flow, removed 58 selfloop flow, removed 8 redundant places. [2025-01-10 01:11:10,622 INFO L231 Difference]: Finished difference. Result has 219 places, 410 transitions, 4786 flow [2025-01-10 01:11:10,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=4786, PETRI_PLACES=219, PETRI_TRANSITIONS=410} [2025-01-10 01:11:10,625 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 161 predicate places. [2025-01-10 01:11:10,625 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 410 transitions, 4786 flow [2025-01-10 01:11:10,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 21.5) internal successors, (645), 30 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:10,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:10,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:10,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:11:10,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:10,826 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:11:10,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 190936330, now seen corresponding path program 3 times [2025-01-10 01:11:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888987887] [2025-01-10 01:11:10,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:10,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:11:10,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:11:10,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:10,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888987887] [2025-01-10 01:11:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888987887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048145594] [2025-01-10 01:11:11,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:11,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:11,295 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:11:11,297 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:11:11,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:11:11,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:11:11,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:11,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:11,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:11:11,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:11,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:11:11,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2025-01-10 01:11:11,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-01-10 01:11:11,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-10 01:11:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:11,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:11,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2025-01-10 01:11:11,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2025-01-10 01:11:12,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 169 [2025-01-10 01:11:12,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:11:12,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2025-01-10 01:11:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048145594] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:17,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:17,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-10 01:11:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509689121] [2025-01-10 01:11:17,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:17,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:11:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:17,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:11:17,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:11:19,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-01-10 01:11:19,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 410 transitions, 4786 flow. Second operand has 30 states, 30 states have (on average 21.5) internal successors, (645), 30 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:19,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:19,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-01-10 01:11:19,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:27,921 INFO L124 PetriNetUnfolderBase]: 26206/39003 cut-off events. [2025-01-10 01:11:27,921 INFO L125 PetriNetUnfolderBase]: For 252348/254869 co-relation queries the response was YES. [2025-01-10 01:11:28,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185234 conditions, 39003 events. 26206/39003 cut-off events. For 252348/254869 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 258774 event pairs, 1631 based on Foata normal form. 302/39277 useless extension candidates. Maximal degree in co-relation 184826. Up to 19717 conditions per place. [2025-01-10 01:11:28,520 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 487 selfloop transitions, 509 changer transitions 54/1061 dead transitions. [2025-01-10 01:11:28,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1061 transitions, 12814 flow [2025-01-10 01:11:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-10 01:11:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-01-10 01:11:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 1761 transitions. [2025-01-10 01:11:28,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744073275862069 [2025-01-10 01:11:28,524 INFO L175 Difference]: Start difference. First operand has 219 places, 410 transitions, 4786 flow. Second operand 64 states and 1761 transitions. [2025-01-10 01:11:28,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1061 transitions, 12814 flow [2025-01-10 01:11:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1061 transitions, 12402 flow, removed 196 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:30,096 INFO L231 Difference]: Finished difference. Result has 307 places, 690 transitions, 9802 flow [2025-01-10 01:11:30,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=4526, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=9802, PETRI_PLACES=307, PETRI_TRANSITIONS=690} [2025-01-10 01:11:30,097 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 249 predicate places. [2025-01-10 01:11:30,097 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 690 transitions, 9802 flow [2025-01-10 01:11:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 21.5) internal successors, (645), 30 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:30,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:30,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:30,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 01:11:30,302 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,SelfDestructingSolverStorable21 [2025-01-10 01:11:30,302 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:11:30,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1112780284, now seen corresponding path program 4 times [2025-01-10 01:11:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:30,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399166456] [2025-01-10 01:11:30,302 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:30,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:11:30,323 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:11:30,324 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:30,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399166456] [2025-01-10 01:11:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399166456] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849027466] [2025-01-10 01:11:30,654 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:30,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:30,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:30,659 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:11:30,661 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:11:30,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:11:30,730 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:11:30,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:30,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:30,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:11:30,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:30,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:11:31,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2025-01-10 01:11:31,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-01-10 01:11:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-10 01:11:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:31,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:31,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2025-01-10 01:11:31,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2025-01-10 01:11:31,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 169 [2025-01-10 01:11:31,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:11:31,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2025-01-10 01:11:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849027466] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:39,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-10 01:11:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016702138] [2025-01-10 01:11:39,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:11:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:39,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:11:39,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:11:41,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-01-10 01:11:41,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 690 transitions, 9802 flow. Second operand has 30 states, 30 states have (on average 20.5) internal successors, (615), 30 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:41,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:41,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-01-10 01:11:41,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand