./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-channel-sum.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-channel-sum.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 bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:07:22,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:07:22,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:07:22,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:07:22,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:07:22,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:07:22,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:07:22,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:07:22,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:07:22,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:07:22,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:07:22,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:07:22,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:07:22,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:07:22,123 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:07:22,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:07:22,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:22,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:22,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:22,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:07:22,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:07:22,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:07:22,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:07:22,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:07:22,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:07:22,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:07:22,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:07:22,125 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 -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 [2025-01-10 01:07:22,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:07:22,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:07:22,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:07:22,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:07:22,472 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:07:22,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-01-10 01:07:23,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cf757914/e33fe787a87a4c7a9f5c9f3aa37ef78b/FLAG2e4c3030f [2025-01-10 01:07:23,892 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:07:23,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-01-10 01:07:23,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cf757914/e33fe787a87a4c7a9f5c9f3aa37ef78b/FLAG2e4c3030f [2025-01-10 01:07:24,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cf757914/e33fe787a87a4c7a9f5c9f3aa37ef78b [2025-01-10 01:07:24,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:07:24,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:07:24,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:24,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:07:24,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:07:24,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec155f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24, skipping insertion in model container [2025-01-10 01:07:24,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:07:24,481 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:07:24,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:24,505 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:07:24,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:24,547 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:07:24,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24 WrapperNode [2025-01-10 01:07:24,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:24,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:24,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:07:24,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:07:24,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,579 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 130 [2025-01-10 01:07:24,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:24,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:07:24,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:07:24,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:07:24,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,611 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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:07:24,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:07:24,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:07:24,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:07:24,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:07:24,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (1/1) ... [2025-01-10 01:07:24,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:24,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:24,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:07:24,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:07:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:07:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:07:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:07:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:07:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:07:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:07:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:07:24,690 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:07:24,755 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:07:24,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:07:24,911 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:07:24,911 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:07:25,060 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:07:25,061 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:07:25,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:25 BoogieIcfgContainer [2025-01-10 01:07:25,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:07:25,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:07:25,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:07:25,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:07:25,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:07:24" (1/3) ... [2025-01-10 01:07:25,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ce8fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:25, skipping insertion in model container [2025-01-10 01:07:25,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:24" (2/3) ... [2025-01-10 01:07:25,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ce8fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:25, skipping insertion in model container [2025-01-10 01:07:25,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:25" (3/3) ... [2025-01-10 01:07:25,069 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-01-10 01:07:25,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:07:25,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 46 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-01-10 01:07:25,080 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:07:25,135 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:07:25,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 114 flow [2025-01-10 01:07:25,186 INFO L124 PetriNetUnfolderBase]: 5/48 cut-off events. [2025-01-10 01:07:25,188 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:07:25,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 48 events. 5/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-01-10 01:07:25,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 50 transitions, 114 flow [2025-01-10 01:07:25,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 47 transitions, 106 flow [2025-01-10 01:07:25,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:07:25,214 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;@1c00fdc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:07:25,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 01:07:25,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:07:25,222 INFO L124 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-01-10 01:07:25,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:07:25,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:25,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:25,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:25,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash -369572235, now seen corresponding path program 1 times [2025-01-10 01:07:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971679512] [2025-01-10 01:07:25,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:25,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:07:25,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:07:25,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:25,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:25,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971679512] [2025-01-10 01:07:25,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971679512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:25,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:25,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084394115] [2025-01-10 01:07:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:25,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:25,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:25,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:25,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-10 01:07:25,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 106 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:07:25,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:25,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-10 01:07:25,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:25,521 INFO L124 PetriNetUnfolderBase]: 237/477 cut-off events. [2025-01-10 01:07:25,521 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 01:07:25,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 477 events. 237/477 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2194 event pairs, 167 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 785. Up to 356 conditions per place. [2025-01-10 01:07:25,526 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-01-10 01:07:25,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 150 flow [2025-01-10 01:07:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 01:07:25,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2025-01-10 01:07:25,536 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 106 flow. Second operand 3 states and 89 transitions. [2025-01-10 01:07:25,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 150 flow [2025-01-10 01:07:25,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:25,540 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 94 flow [2025-01-10 01:07:25,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=90, 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=94, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-01-10 01:07:25,544 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-01-10 01:07:25,544 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 94 flow [2025-01-10 01:07:25,544 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:07:25,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:25,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:25,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:07:25,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash -369572234, now seen corresponding path program 1 times [2025-01-10 01:07:25,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:25,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239684521] [2025-01-10 01:07:25,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:25,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:25,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:07:25,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:07:25,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:25,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239684521] [2025-01-10 01:07:25,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239684521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:25,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:25,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418884133] [2025-01-10 01:07:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:25,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:25,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:25,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:25,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-10 01:07:25,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:25,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:25,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-10 01:07:25,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:25,989 INFO L124 PetriNetUnfolderBase]: 238/480 cut-off events. [2025-01-10 01:07:25,990 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:07:25,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 480 events. 238/480 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2217 event pairs, 167 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 828. Up to 361 conditions per place. [2025-01-10 01:07:25,996 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 26 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-01-10 01:07:25,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 162 flow [2025-01-10 01:07:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-01-10 01:07:26,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-01-10 01:07:26,001 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 94 flow. Second operand 4 states and 111 transitions. [2025-01-10 01:07:26,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 162 flow [2025-01-10 01:07:26,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:26,003 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 117 flow [2025-01-10 01:07:26,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-01-10 01:07:26,008 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-01-10 01:07:26,008 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 117 flow [2025-01-10 01:07:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:26,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:26,008 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:26,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:07:26,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:26,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1323382269, now seen corresponding path program 1 times [2025-01-10 01:07:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72010376] [2025-01-10 01:07:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:26,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:26,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:26,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:26,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72010376] [2025-01-10 01:07:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72010376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323727054] [2025-01-10 01:07:26,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:26,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:26,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:26,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:26,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:07:26,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:26,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:26,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:26,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:26,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:07:26,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:26,445 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:07:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:26,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:26,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323727054] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:26,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:26,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:07:26,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775512238] [2025-01-10 01:07:26,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:26,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:26,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:26,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:26,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-10 01:07:26,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 117 flow. Second operand has 11 states, 11 states have (on average 21.454545454545453) internal successors, (236), 11 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:26,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:26,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-10 01:07:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:27,007 INFO L124 PetriNetUnfolderBase]: 238/479 cut-off events. [2025-01-10 01:07:27,008 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:07:27,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 479 events. 238/479 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2255 event pairs, 167 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 840. Up to 357 conditions per place. [2025-01-10 01:07:27,010 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 22 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2025-01-10 01:07:27,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 171 flow [2025-01-10 01:07:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-01-10 01:07:27,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:07:27,011 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 117 flow. Second operand 6 states and 150 transitions. [2025-01-10 01:07:27,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 171 flow [2025-01-10 01:07:27,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:27,012 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 124 flow [2025-01-10 01:07:27,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-01-10 01:07:27,013 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2025-01-10 01:07:27,013 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 124 flow [2025-01-10 01:07:27,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.454545454545453) internal successors, (236), 11 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:27,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:27,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:27,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:07:27,213 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:07:27,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:27,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1922011070, now seen corresponding path program 1 times [2025-01-10 01:07:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117531902] [2025-01-10 01:07:27,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:27,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:27,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:07:27,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:07:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:27,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:27,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117531902] [2025-01-10 01:07:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117531902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:27,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207682541] [2025-01-10 01:07:27,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:27,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:27,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:27,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:07:27,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 124 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:07:27,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:27,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:07:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:27,315 INFO L124 PetriNetUnfolderBase]: 224/506 cut-off events. [2025-01-10 01:07:27,315 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 01:07:27,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 506 events. 224/506 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2417 event pairs, 88 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 888. Up to 254 conditions per place. [2025-01-10 01:07:27,317 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-01-10 01:07:27,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 240 flow [2025-01-10 01:07:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-01-10 01:07:27,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-01-10 01:07:27,319 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 124 flow. Second operand 3 states and 99 transitions. [2025-01-10 01:07:27,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 240 flow [2025-01-10 01:07:27,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 210 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:07:27,320 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 132 flow [2025-01-10 01:07:27,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-01-10 01:07:27,320 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-01-10 01:07:27,321 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 132 flow [2025-01-10 01:07:27,321 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:07:27,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:27,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:27,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:07:27,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:27,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 74221539, now seen corresponding path program 1 times [2025-01-10 01:07:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329084691] [2025-01-10 01:07:27,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:27,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:07:27,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:07:27,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:27,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:27,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329084691] [2025-01-10 01:07:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329084691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:27,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778031534] [2025-01-10 01:07:27,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:27,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:27,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:27,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:27,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-10 01:07:27,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:27,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:27,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-10 01:07:27,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:27,513 INFO L124 PetriNetUnfolderBase]: 246/546 cut-off events. [2025-01-10 01:07:27,513 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-01-10 01:07:27,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 546 events. 246/546 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2566 event pairs, 167 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 354. Up to 380 conditions per place. [2025-01-10 01:07:27,519 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 40 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-01-10 01:07:27,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 250 flow [2025-01-10 01:07:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-01-10 01:07:27,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63 [2025-01-10 01:07:27,521 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 132 flow. Second operand 4 states and 126 transitions. [2025-01-10 01:07:27,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 250 flow [2025-01-10 01:07:27,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:27,524 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 133 flow [2025-01-10 01:07:27,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2025-01-10 01:07:27,524 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-01-10 01:07:27,524 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 133 flow [2025-01-10 01:07:27,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:27,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:27,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:27,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:07:27,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:27,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash 884466300, now seen corresponding path program 1 times [2025-01-10 01:07:27,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:27,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61535173] [2025-01-10 01:07:27,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:27,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:27,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:27,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:27,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:27,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:27,801 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:07:27,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61535173] [2025-01-10 01:07:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61535173] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:27,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895093527] [2025-01-10 01:07:27,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:27,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:27,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:27,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:27,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:07:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:27,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:27,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:27,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:27,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:27,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:27,958 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:07:27,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:07:27,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895093527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:27,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:07:27,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 01:07:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210082203] [2025-01-10 01:07:27,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:27,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:27,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:27,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:27,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:07:28,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-10 01:07:28,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:28,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:28,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-10 01:07:28,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:28,112 INFO L124 PetriNetUnfolderBase]: 246/552 cut-off events. [2025-01-10 01:07:28,112 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-01-10 01:07:28,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 552 events. 246/552 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2568 event pairs, 107 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 1005. Up to 299 conditions per place. [2025-01-10 01:07:28,114 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 33 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-01-10 01:07:28,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 234 flow [2025-01-10 01:07:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-10 01:07:28,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.504 [2025-01-10 01:07:28,116 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 133 flow. Second operand 5 states and 126 transitions. [2025-01-10 01:07:28,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 234 flow [2025-01-10 01:07:28,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:28,117 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 137 flow [2025-01-10 01:07:28,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-01-10 01:07:28,118 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2025-01-10 01:07:28,118 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 137 flow [2025-01-10 01:07:28,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:28,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:28,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:28,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:07:28,318 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:07:28,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 884466299, now seen corresponding path program 1 times [2025-01-10 01:07:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64844235] [2025-01-10 01:07:28,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:28,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:28,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:28,384 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:07:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64844235] [2025-01-10 01:07:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64844235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575752218] [2025-01-10 01:07:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:28,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:28,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:28,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-01-10 01:07:28,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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:07:28,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:28,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-01-10 01:07:28,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:28,457 INFO L124 PetriNetUnfolderBase]: 246/496 cut-off events. [2025-01-10 01:07:28,457 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 01:07:28,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 496 events. 246/496 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2054 event pairs, 167 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 320. Up to 431 conditions per place. [2025-01-10 01:07:28,459 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 29 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-01-10 01:07:28,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 195 flow [2025-01-10 01:07:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-01-10 01:07:28,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.485 [2025-01-10 01:07:28,460 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 137 flow. Second operand 4 states and 97 transitions. [2025-01-10 01:07:28,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 195 flow [2025-01-10 01:07:28,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 179 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:28,462 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 121 flow [2025-01-10 01:07:28,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-01-10 01:07:28,462 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-01-10 01:07:28,462 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 121 flow [2025-01-10 01:07:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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:07:28,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:28,464 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] [2025-01-10 01:07:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:07:28,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash 337011924, now seen corresponding path program 1 times [2025-01-10 01:07:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62837947] [2025-01-10 01:07:28,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:28,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:28,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:28,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:28,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62837947] [2025-01-10 01:07:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62837947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:28,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:28,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438127817] [2025-01-10 01:07:28,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:28,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:28,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:28,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:28,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:28,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-10 01:07:28,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:28,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:28,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-10 01:07:28,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:28,562 INFO L124 PetriNetUnfolderBase]: 353/727 cut-off events. [2025-01-10 01:07:28,563 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-01-10 01:07:28,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 727 events. 353/727 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3200 event pairs, 155 based on Foata normal form. 3/681 useless extension candidates. Maximal degree in co-relation 1414. Up to 362 conditions per place. [2025-01-10 01:07:28,565 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 45 selfloop transitions, 2 changer transitions 3/61 dead transitions. [2025-01-10 01:07:28,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 273 flow [2025-01-10 01:07:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-01-10 01:07:28,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2025-01-10 01:07:28,566 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 121 flow. Second operand 3 states and 106 transitions. [2025-01-10 01:07:28,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 273 flow [2025-01-10 01:07:28,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:28,567 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 121 flow [2025-01-10 01:07:28,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-01-10 01:07:28,568 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2025-01-10 01:07:28,568 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 121 flow [2025-01-10 01:07:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:28,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:28,568 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] [2025-01-10 01:07:28,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:07:28,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1315272269, now seen corresponding path program 1 times [2025-01-10 01:07:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:28,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485129391] [2025-01-10 01:07:28,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:28,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:28,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:28,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:28,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:28,656 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:07:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485129391] [2025-01-10 01:07:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485129391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:07:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179390169] [2025-01-10 01:07:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:28,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:07:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:28,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:07:28,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:07:28,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-10 01:07:28,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:28,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:28,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-10 01:07:28,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:28,869 INFO L124 PetriNetUnfolderBase]: 332/650 cut-off events. [2025-01-10 01:07:28,869 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-01-10 01:07:28,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 650 events. 332/650 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2849 event pairs, 39 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1439. Up to 238 conditions per place. [2025-01-10 01:07:28,872 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 62 selfloop transitions, 11 changer transitions 3/84 dead transitions. [2025-01-10 01:07:28,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 387 flow [2025-01-10 01:07:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-01-10 01:07:28,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-01-10 01:07:28,874 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 121 flow. Second operand 7 states and 196 transitions. [2025-01-10 01:07:28,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 387 flow [2025-01-10 01:07:28,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 373 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:28,876 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 160 flow [2025-01-10 01:07:28,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-01-10 01:07:28,877 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-01-10 01:07:28,877 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 160 flow [2025-01-10 01:07:28,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:28,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:28,878 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:28,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:07:28,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:28,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash 398897489, now seen corresponding path program 1 times [2025-01-10 01:07:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550477778] [2025-01-10 01:07:28,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:07:28,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:07:28,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:29,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550477778] [2025-01-10 01:07:29,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550477778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583711479] [2025-01-10 01:07:29,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:29,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:29,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:07:29,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:07:29,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:07:29,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:29,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:29,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:07:29,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:29,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:07:29,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583711479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:29,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:07:29,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-01-10 01:07:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596238739] [2025-01-10 01:07:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:29,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:29,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:29,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:07:29,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:07:29,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:29,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:29,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:07:29,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:29,351 INFO L124 PetriNetUnfolderBase]: 654/1306 cut-off events. [2025-01-10 01:07:29,351 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2025-01-10 01:07:29,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3108 conditions, 1306 events. 654/1306 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6552 event pairs, 191 based on Foata normal form. 16/1218 useless extension candidates. Maximal degree in co-relation 3071. Up to 449 conditions per place. [2025-01-10 01:07:29,357 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 59 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2025-01-10 01:07:29,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 424 flow [2025-01-10 01:07:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-01-10 01:07:29,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-01-10 01:07:29,358 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 160 flow. Second operand 4 states and 136 transitions. [2025-01-10 01:07:29,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 424 flow [2025-01-10 01:07:29,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:29,361 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 249 flow [2025-01-10 01:07:29,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2025-01-10 01:07:29,361 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-01-10 01:07:29,362 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 249 flow [2025-01-10 01:07:29,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:29,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:29,362 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:29,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:07:29,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:29,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:29,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1017095755, now seen corresponding path program 1 times [2025-01-10 01:07:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455936083] [2025-01-10 01:07:29,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:29,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:07:29,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:07:29,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:29,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:29,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455936083] [2025-01-10 01:07:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455936083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930038884] [2025-01-10 01:07:29,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:29,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:29,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:29,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:29,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:07:29,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:07:29,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:07:29,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:29,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:07:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:29,904 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:07:29,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:30,017 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:07:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930038884] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:30,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 01:07:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255679387] [2025-01-10 01:07:30,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:07:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:30,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:07:30,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:07:30,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-10 01:07:30,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 249 flow. Second operand has 17 states, 17 states have (on average 19.41176470588235) internal successors, (330), 17 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:30,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:30,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-10 01:07:30,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:30,744 INFO L124 PetriNetUnfolderBase]: 786/1520 cut-off events. [2025-01-10 01:07:30,744 INFO L125 PetriNetUnfolderBase]: For 1316/1316 co-relation queries the response was YES. [2025-01-10 01:07:30,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 1520 events. 786/1520 cut-off events. For 1316/1316 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7582 event pairs, 541 based on Foata normal form. 0/1416 useless extension candidates. Maximal degree in co-relation 3621. Up to 1186 conditions per place. [2025-01-10 01:07:30,751 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 64 selfloop transitions, 15 changer transitions 2/89 dead transitions. [2025-01-10 01:07:30,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 532 flow [2025-01-10 01:07:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:07:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:07:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 243 transitions. [2025-01-10 01:07:30,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44181818181818183 [2025-01-10 01:07:30,753 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 249 flow. Second operand 11 states and 243 transitions. [2025-01-10 01:07:30,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 532 flow [2025-01-10 01:07:30,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:30,756 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 378 flow [2025-01-10 01:07:30,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=378, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-01-10 01:07:30,756 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2025-01-10 01:07:30,756 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 378 flow [2025-01-10 01:07:30,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.41176470588235) internal successors, (330), 17 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:30,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:30,757 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:30,763 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:07:30,957 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,SelfDestructingSolverStorable10 [2025-01-10 01:07:30,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -514225171, now seen corresponding path program 1 times [2025-01-10 01:07:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:30,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925440698] [2025-01-10 01:07:30,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:30,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:07:30,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:07:30,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:30,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925440698] [2025-01-10 01:07:31,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925440698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559721291] [2025-01-10 01:07:31,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:31,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:31,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:07:31,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:07:31,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:07:31,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:31,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:31,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:07:31,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:31,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:07:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:31,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:31,976 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 61 treesize of output 55 [2025-01-10 01:07:31,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:07:31,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-01-10 01:07:32,131 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:07:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559721291] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:32,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-01-10 01:07:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010354161] [2025-01-10 01:07:32,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:32,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:07:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:32,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:07:32,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:07:32,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:07:32,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 378 flow. Second operand has 28 states, 28 states have (on average 21.5) internal successors, (602), 28 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:32,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:32,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:07:32,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:33,930 INFO L124 PetriNetUnfolderBase]: 924/1859 cut-off events. [2025-01-10 01:07:33,931 INFO L125 PetriNetUnfolderBase]: For 2389/2389 co-relation queries the response was YES. [2025-01-10 01:07:33,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5446 conditions, 1859 events. 924/1859 cut-off events. For 2389/2389 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9970 event pairs, 115 based on Foata normal form. 1/1818 useless extension candidates. Maximal degree in co-relation 4469. Up to 587 conditions per place. [2025-01-10 01:07:33,940 INFO L140 encePairwiseOnDemand]: 32/50 looper letters, 100 selfloop transitions, 56 changer transitions 74/239 dead transitions. [2025-01-10 01:07:33,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 239 transitions, 1575 flow [2025-01-10 01:07:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:07:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 01:07:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 783 transitions. [2025-01-10 01:07:33,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5051612903225806 [2025-01-10 01:07:33,942 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 378 flow. Second operand 31 states and 783 transitions. [2025-01-10 01:07:33,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 239 transitions, 1575 flow [2025-01-10 01:07:33,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 239 transitions, 1571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:33,948 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 795 flow [2025-01-10 01:07:33,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=795, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2025-01-10 01:07:33,948 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 62 predicate places. [2025-01-10 01:07:33,948 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 795 flow [2025-01-10 01:07:33,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 21.5) internal successors, (602), 28 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:33,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:33,949 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:33,955 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:07:34,149 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,SelfDestructingSolverStorable11 [2025-01-10 01:07:34,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:34,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1112641527, now seen corresponding path program 1 times [2025-01-10 01:07:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172688748] [2025-01-10 01:07:34,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:34,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:07:34,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:07:34,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:34,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:34,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:34,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172688748] [2025-01-10 01:07:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172688748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:34,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:34,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:34,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383249147] [2025-01-10 01:07:34,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:34,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:34,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:34,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:34,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:34,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:07:34,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:34,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:34,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:07:34,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:34,340 INFO L124 PetriNetUnfolderBase]: 851/1577 cut-off events. [2025-01-10 01:07:34,340 INFO L125 PetriNetUnfolderBase]: For 4288/4288 co-relation queries the response was YES. [2025-01-10 01:07:34,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5846 conditions, 1577 events. 851/1577 cut-off events. For 4288/4288 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7381 event pairs, 385 based on Foata normal form. 4/1581 useless extension candidates. Maximal degree in co-relation 5802. Up to 1382 conditions per place. [2025-01-10 01:07:34,350 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 89 selfloop transitions, 2 changer transitions 6/106 dead transitions. [2025-01-10 01:07:34,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 106 transitions, 987 flow [2025-01-10 01:07:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 01:07:34,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 01:07:34,351 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 795 flow. Second operand 3 states and 100 transitions. [2025-01-10 01:07:34,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 106 transitions, 987 flow [2025-01-10 01:07:34,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 106 transitions, 896 flow, removed 28 selfloop flow, removed 15 redundant places. [2025-01-10 01:07:34,366 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 607 flow [2025-01-10 01:07:34,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-01-10 01:07:34,367 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2025-01-10 01:07:34,367 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 607 flow [2025-01-10 01:07:34,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:34,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:34,368 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:34,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:07:34,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:34,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:34,369 INFO L85 PathProgramCache]: Analyzing trace with hash -322479778, now seen corresponding path program 2 times [2025-01-10 01:07:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:34,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849794629] [2025-01-10 01:07:34,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:34,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:07:34,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-01-10 01:07:34,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:07:34,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849794629] [2025-01-10 01:07:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849794629] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499689090] [2025-01-10 01:07:34,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:34,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:34,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:34,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:34,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:07:34,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:07:34,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-01-10 01:07:34,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:07:34,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:34,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:07:34,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:34,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:07:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:34,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:07:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499689090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:35,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2025-01-10 01:07:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674801020] [2025-01-10 01:07:35,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:35,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:07:35,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:35,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:07:35,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:35,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-10 01:07:35,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 607 flow. Second operand has 13 states, 13 states have (on average 22.615384615384617) internal successors, (294), 13 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:35,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:35,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-10 01:07:35,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:35,726 INFO L124 PetriNetUnfolderBase]: 668/1235 cut-off events. [2025-01-10 01:07:35,726 INFO L125 PetriNetUnfolderBase]: For 2664/2664 co-relation queries the response was YES. [2025-01-10 01:07:35,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4492 conditions, 1235 events. 668/1235 cut-off events. For 2664/2664 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5659 event pairs, 267 based on Foata normal form. 52/1281 useless extension candidates. Maximal degree in co-relation 4419. Up to 730 conditions per place. [2025-01-10 01:07:35,733 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 77 selfloop transitions, 16 changer transitions 0/102 dead transitions. [2025-01-10 01:07:35,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 102 transitions, 869 flow [2025-01-10 01:07:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:07:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:07:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-01-10 01:07:35,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2025-01-10 01:07:35,734 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 607 flow. Second operand 6 states and 146 transitions. [2025-01-10 01:07:35,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 102 transitions, 869 flow [2025-01-10 01:07:35,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 852 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 01:07:35,741 INFO L231 Difference]: Finished difference. Result has 80 places, 89 transitions, 620 flow [2025-01-10 01:07:35,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=80, PETRI_TRANSITIONS=89} [2025-01-10 01:07:35,742 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2025-01-10 01:07:35,742 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 89 transitions, 620 flow [2025-01-10 01:07:35,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.615384615384617) internal successors, (294), 13 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:35,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:35,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:35,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:35,942 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,SelfDestructingSolverStorable13 [2025-01-10 01:07:35,943 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:35,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:35,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1128288380, now seen corresponding path program 2 times [2025-01-10 01:07:35,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:35,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330408105] [2025-01-10 01:07:35,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:35,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:35,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:07:35,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:07:35,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:35,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:36,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330408105] [2025-01-10 01:07:36,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330408105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138997300] [2025-01-10 01:07:36,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:36,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:36,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:36,407 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:36,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:07:36,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:07:36,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:07:36,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:36,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:36,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:36,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:36,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:07:36,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2025-01-10 01:07:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:07:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138997300] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:36,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 20 [2025-01-10 01:07:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731226203] [2025-01-10 01:07:36,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:36,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:07:36,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:36,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:07:36,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:07:37,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:07:37,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 89 transitions, 620 flow. Second operand has 21 states, 21 states have (on average 22.666666666666668) internal successors, (476), 21 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:37,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:37,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:07:37,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:37,668 INFO L124 PetriNetUnfolderBase]: 1251/2320 cut-off events. [2025-01-10 01:07:37,668 INFO L125 PetriNetUnfolderBase]: For 5356/5368 co-relation queries the response was YES. [2025-01-10 01:07:37,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8505 conditions, 2320 events. 1251/2320 cut-off events. For 5356/5368 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11869 event pairs, 164 based on Foata normal form. 15/2327 useless extension candidates. Maximal degree in co-relation 8090. Up to 745 conditions per place. [2025-01-10 01:07:37,681 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 165 selfloop transitions, 28 changer transitions 11/213 dead transitions. [2025-01-10 01:07:37,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 213 transitions, 1783 flow [2025-01-10 01:07:37,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:07:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:07:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 434 transitions. [2025-01-10 01:07:37,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425 [2025-01-10 01:07:37,683 INFO L175 Difference]: Start difference. First operand has 80 places, 89 transitions, 620 flow. Second operand 16 states and 434 transitions. [2025-01-10 01:07:37,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 213 transitions, 1783 flow [2025-01-10 01:07:37,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 213 transitions, 1723 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:07:37,693 INFO L231 Difference]: Finished difference. Result has 92 places, 102 transitions, 756 flow [2025-01-10 01:07:37,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=756, PETRI_PLACES=92, PETRI_TRANSITIONS=102} [2025-01-10 01:07:37,694 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places. [2025-01-10 01:07:37,694 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 102 transitions, 756 flow [2025-01-10 01:07:37,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 22.666666666666668) internal successors, (476), 21 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:37,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:37,694 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:37,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:37,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:37,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:37,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1860189748, now seen corresponding path program 3 times [2025-01-10 01:07:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514599547] [2025-01-10 01:07:37,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:37,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-01-10 01:07:37,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 46 statements. [2025-01-10 01:07:37,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:37,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:07:37,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514599547] [2025-01-10 01:07:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514599547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908213213] [2025-01-10 01:07:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:37,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:37,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:37,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-10 01:07:37,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 102 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:37,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:37,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-10 01:07:37,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:38,269 INFO L124 PetriNetUnfolderBase]: 2002/3583 cut-off events. [2025-01-10 01:07:38,269 INFO L125 PetriNetUnfolderBase]: For 8182/8182 co-relation queries the response was YES. [2025-01-10 01:07:38,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12854 conditions, 3583 events. 2002/3583 cut-off events. For 8182/8182 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 18228 event pairs, 492 based on Foata normal form. 173/3756 useless extension candidates. Maximal degree in co-relation 11017. Up to 1801 conditions per place. [2025-01-10 01:07:38,291 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 117 selfloop transitions, 4 changer transitions 2/130 dead transitions. [2025-01-10 01:07:38,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 130 transitions, 1200 flow [2025-01-10 01:07:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-01-10 01:07:38,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-01-10 01:07:38,292 INFO L175 Difference]: Start difference. First operand has 92 places, 102 transitions, 756 flow. Second operand 4 states and 118 transitions. [2025-01-10 01:07:38,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 130 transitions, 1200 flow [2025-01-10 01:07:38,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 130 transitions, 1169 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:38,302 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 737 flow [2025-01-10 01:07:38,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=737, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-01-10 01:07:38,304 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 44 predicate places. [2025-01-10 01:07:38,304 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 737 flow [2025-01-10 01:07:38,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:38,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:38,304 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:38,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:07:38,304 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:38,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash -120743778, now seen corresponding path program 1 times [2025-01-10 01:07:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:38,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356765890] [2025-01-10 01:07:38,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:38,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:07:38,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:07:38,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:38,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356765890] [2025-01-10 01:07:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356765890] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199405327] [2025-01-10 01:07:39,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:39,091 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:39,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:07:39,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:07:39,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:07:39,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:39,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:39,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:07:39,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:39,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:40,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:07:40,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-01-10 01:07:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199405327] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:40,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2025-01-10 01:07:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056075438] [2025-01-10 01:07:40,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:40,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-10 01:07:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:40,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-10 01:07:40,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2025-01-10 01:07:41,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:07:41,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 737 flow. Second operand has 43 states, 43 states have (on average 21.325581395348838) internal successors, (917), 43 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:41,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:41,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:07:41,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:55,276 INFO L124 PetriNetUnfolderBase]: 9924/19156 cut-off events. [2025-01-10 01:07:55,276 INFO L125 PetriNetUnfolderBase]: For 46650/46658 co-relation queries the response was YES. [2025-01-10 01:07:55,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68547 conditions, 19156 events. 9924/19156 cut-off events. For 46650/46658 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 148393 event pairs, 663 based on Foata normal form. 193/19277 useless extension candidates. Maximal degree in co-relation 58904. Up to 3297 conditions per place. [2025-01-10 01:07:55,453 INFO L140 encePairwiseOnDemand]: 33/50 looper letters, 824 selfloop transitions, 835 changer transitions 249/1918 dead transitions. [2025-01-10 01:07:55,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1918 transitions, 15197 flow [2025-01-10 01:07:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2025-01-10 01:07:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2025-01-10 01:07:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 5655 transitions. [2025-01-10 01:07:55,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164383561643836 [2025-01-10 01:07:55,471 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 737 flow. Second operand 219 states and 5655 transitions. [2025-01-10 01:07:55,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1918 transitions, 15197 flow [2025-01-10 01:07:55,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1918 transitions, 14965 flow, removed 114 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:55,553 INFO L231 Difference]: Finished difference. Result has 391 places, 936 transitions, 9889 flow [2025-01-10 01:07:55,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=219, PETRI_FLOW=9889, PETRI_PLACES=391, PETRI_TRANSITIONS=936} [2025-01-10 01:07:55,554 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 342 predicate places. [2025-01-10 01:07:55,554 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 936 transitions, 9889 flow [2025-01-10 01:07:55,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 21.325581395348838) internal successors, (917), 43 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:55,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:55,555 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:55,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:55,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:07:55,756 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:07:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1055404618, now seen corresponding path program 2 times [2025-01-10 01:07:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339889976] [2025-01-10 01:07:55,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:55,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 01:07:55,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:07:55,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:55,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339889976] [2025-01-10 01:07:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339889976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259537206] [2025-01-10 01:07:56,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:56,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:56,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:07:56,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:07:56,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 01:07:56,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:07:56,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:56,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:56,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:07:56,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:56,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:07:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:57,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:57,746 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 116 treesize of output 104 [2025-01-10 01:07:57,792 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-10 01:07:57,793 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 232 treesize of output 204 [2025-01-10 01:07:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259537206] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:58,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 46 [2025-01-10 01:07:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988602948] [2025-01-10 01:07:58,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:58,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-10 01:07:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:58,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-10 01:07:58,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1895, Unknown=0, NotChecked=0, Total=2162 [2025-01-10 01:07:59,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:07:59,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 936 transitions, 9889 flow. Second operand has 47 states, 47 states have (on average 21.25531914893617) internal successors, (999), 47 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:59,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:59,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:07:59,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:34,460 INFO L124 PetriNetUnfolderBase]: 31784/61345 cut-off events. [2025-01-10 01:08:34,461 INFO L125 PetriNetUnfolderBase]: For 3385042/3385042 co-relation queries the response was YES. [2025-01-10 01:08:35,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406483 conditions, 61345 events. 31784/61345 cut-off events. For 3385042/3385042 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 561964 event pairs, 2545 based on Foata normal form. 303/61356 useless extension candidates. Maximal degree in co-relation 399232. Up to 10659 conditions per place. [2025-01-10 01:08:35,950 INFO L140 encePairwiseOnDemand]: 32/50 looper letters, 1140 selfloop transitions, 3725 changer transitions 247/5122 dead transitions. [2025-01-10 01:08:35,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 5122 transitions, 68978 flow [2025-01-10 01:08:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2025-01-10 01:08:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2025-01-10 01:08:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 6598 transitions. [2025-01-10 01:08:35,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4905576208178439 [2025-01-10 01:08:35,964 INFO L175 Difference]: Start difference. First operand has 391 places, 936 transitions, 9889 flow. Second operand 269 states and 6598 transitions. [2025-01-10 01:08:35,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 5122 transitions, 68978 flow [2025-01-10 01:08:45,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 5122 transitions, 63196 flow, removed 2708 selfloop flow, removed 14 redundant places. [2025-01-10 01:08:45,908 INFO L231 Difference]: Finished difference. Result has 735 places, 4073 transitions, 55630 flow [2025-01-10 01:08:45,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8574, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=783, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=269, PETRI_FLOW=55630, PETRI_PLACES=735, PETRI_TRANSITIONS=4073} [2025-01-10 01:08:45,909 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 686 predicate places. [2025-01-10 01:08:45,910 INFO L471 AbstractCegarLoop]: Abstraction has has 735 places, 4073 transitions, 55630 flow [2025-01-10 01:08:45,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 21.25531914893617) internal successors, (999), 47 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:45,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:45,911 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:45,918 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:08:46,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:08:46,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 01:08:46,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1165059172, now seen corresponding path program 3 times [2025-01-10 01:08:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:46,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471099610] [2025-01-10 01:08:46,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:08:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:46,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-01-10 01:08:46,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 46 statements. [2025-01-10 01:08:46,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:08:46,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:08:46,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471099610] [2025-01-10 01:08:46,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471099610] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484736532] [2025-01-10 01:08:46,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:08:46,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:46,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:46,468 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:08:46,470 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:08:46,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-01-10 01:08:46,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 46 statements. [2025-01-10 01:08:46,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:08:46,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:46,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:08:46,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:46,805 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2025-01-10 01:08:46,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 41 [2025-01-10 01:08:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:08:46,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:08:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484736532] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:47,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-01-10 01:08:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724863744] [2025-01-10 01:08:47,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:47,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:08:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:47,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:08:47,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:08:47,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-01-10 01:08:47,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 4073 transitions, 55630 flow. Second operand has 35 states, 35 states have (on average 21.428571428571427) internal successors, (750), 35 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:08:47,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:47,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-01-10 01:08:47,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand