./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:11:15,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:11:15,902 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:11:15,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:11:15,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:11:15,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:11:15,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:11:15,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:11:15,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:11:15,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:11:15,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:11:15,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:11:15,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:11:15,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:11:15,948 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:11:15,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:11:15,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:11:15,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:11:15,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:11:15,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:11:15,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:11:15,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:11:15,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:11:15,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:15,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:11:15,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:11:15,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:11:15,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:11:15,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:15,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:11:15,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:11:15,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:11:15,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:11:15,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:11:15,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:11:15,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:11:15,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:11:15,953 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-01-10 01:11:16,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:11:16,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:11:16,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:11:16,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:11:16,223 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:11:16,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-01-10 01:11:17,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dd913fc8/c73feeb1d8614716b86576bf58e18352/FLAG6b60fadee [2025-01-10 01:11:17,729 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:11:17,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-01-10 01:11:17,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dd913fc8/c73feeb1d8614716b86576bf58e18352/FLAG6b60fadee [2025-01-10 01:11:18,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dd913fc8/c73feeb1d8614716b86576bf58e18352 [2025-01-10 01:11:18,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:11:18,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:11:18,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:18,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:11:18,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:11:18,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ef5e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18, skipping insertion in model container [2025-01-10 01:11:18,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:11:18,200 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:11:18,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:18,216 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:11:18,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:18,256 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:11:18,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18 WrapperNode [2025-01-10 01:11:18,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:18,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:18,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:11:18,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:11:18,263 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:11:18" (1/1) ... [2025-01-10 01:11:18,270 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:11:18" (1/1) ... [2025-01-10 01:11:18,297 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 175 [2025-01-10 01:11:18,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:18,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:11:18,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:11:18,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:11:18,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,330 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-01-10 01:11:18,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:11:18,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:11:18,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:11:18,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:11:18,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (1/1) ... [2025-01-10 01:11:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:18,390 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:11:18,392 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:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:11:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:11:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:11:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:11:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:11:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:11:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:11:18,412 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:11:18,495 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:11:18,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:11:18,929 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:11:18,931 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:11:19,177 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:11:19,178 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:11:19,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:19 BoogieIcfgContainer [2025-01-10 01:11:19,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:11:19,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:11:19,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:11:19,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:11:19,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:11:18" (1/3) ... [2025-01-10 01:11:19,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a132d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:19, skipping insertion in model container [2025-01-10 01:11:19,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:18" (2/3) ... [2025-01-10 01:11:19,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a132d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:19, skipping insertion in model container [2025-01-10 01:11:19,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:19" (3/3) ... [2025-01-10 01:11:19,190 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-01-10 01:11:19,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:11:19,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 74 locations, 1 initial locations, 7 loop locations, and 32 error locations. [2025-01-10 01:11:19,207 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:11:19,277 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:11:19,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 181 flow [2025-01-10 01:11:19,349 INFO L124 PetriNetUnfolderBase]: 7/77 cut-off events. [2025-01-10 01:11:19,351 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:19,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 77 events. 7/77 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 209 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-01-10 01:11:19,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 80 transitions, 181 flow [2025-01-10 01:11:19,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 76 transitions, 170 flow [2025-01-10 01:11:19,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:11:19,383 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;@1a5b8328, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:11:19,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-01-10 01:11:19,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:11:19,386 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:11:19,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:11:19,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:19,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:11:19,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:19,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 709074, now seen corresponding path program 1 times [2025-01-10 01:11:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:19,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040921127] [2025-01-10 01:11:19,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:19,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:11:19,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:11:19,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:19,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:19,612 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:11:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040921127] [2025-01-10 01:11:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040921127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:11:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124130004] [2025-01-10 01:11:19,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:19,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:11:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:19,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:11:19,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:11:19,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-01-10 01:11:19,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:19,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:19,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-01-10 01:11:19,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:19,902 INFO L124 PetriNetUnfolderBase]: 203/468 cut-off events. [2025-01-10 01:11:19,902 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 01:11:19,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 468 events. 203/468 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2276 event pairs, 124 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 687. Up to 294 conditions per place. [2025-01-10 01:11:19,911 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 31 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-01-10 01:11:19,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 224 flow [2025-01-10 01:11:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:11:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:11:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-01-10 01:11:19,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2025-01-10 01:11:19,924 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 170 flow. Second operand 3 states and 161 transitions. [2025-01-10 01:11:19,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 224 flow [2025-01-10 01:11:19,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 212 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:19,933 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 150 flow [2025-01-10 01:11:19,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2025-01-10 01:11:19,939 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2025-01-10 01:11:19,942 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 150 flow [2025-01-10 01:11:19,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:19,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:19,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:11:19,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:11:19,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:19,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:19,943 INFO L85 PathProgramCache]: Analyzing trace with hash 709075, now seen corresponding path program 1 times [2025-01-10 01:11:19,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:19,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546001634] [2025-01-10 01:11:19,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:19,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:11:19,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:11:19,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:19,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:20,211 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:11:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546001634] [2025-01-10 01:11:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546001634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384645569] [2025-01-10 01:11:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:20,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:20,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:20,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:20,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-01-10 01:11:20,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:20,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:20,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-01-10 01:11:20,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:20,525 INFO L124 PetriNetUnfolderBase]: 204/471 cut-off events. [2025-01-10 01:11:20,525 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:20,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 471 events. 204/471 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2284 event pairs, 124 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 756. Up to 311 conditions per place. [2025-01-10 01:11:20,532 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 36 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-01-10 01:11:20,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 236 flow [2025-01-10 01:11:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-01-10 01:11:20,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-01-10 01:11:20,560 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 150 flow. Second operand 4 states and 205 transitions. [2025-01-10 01:11:20,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 236 flow [2025-01-10 01:11:20,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:20,563 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 173 flow [2025-01-10 01:11:20,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2025-01-10 01:11:20,564 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2025-01-10 01:11:20,564 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 173 flow [2025-01-10 01:11:20,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:20,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:20,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:11:20,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:11:20,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:20,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 21982822, now seen corresponding path program 1 times [2025-01-10 01:11:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553445740] [2025-01-10 01:11:20,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:20,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:20,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:11:20,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:11:20,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:20,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:20,677 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:11:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553445740] [2025-01-10 01:11:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553445740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:20,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:20,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:11:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900913076] [2025-01-10 01:11:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:20,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:20,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:20,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:20,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:20,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2025-01-10 01:11:20,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:20,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:20,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2025-01-10 01:11:20,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:20,847 INFO L124 PetriNetUnfolderBase]: 207/486 cut-off events. [2025-01-10 01:11:20,847 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:20,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 486 events. 207/486 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2407 event pairs, 124 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 769. Up to 308 conditions per place. [2025-01-10 01:11:20,854 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 35 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2025-01-10 01:11:20,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 85 transitions, 293 flow [2025-01-10 01:11:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-01-10 01:11:20,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.721875 [2025-01-10 01:11:20,858 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 173 flow. Second operand 4 states and 231 transitions. [2025-01-10 01:11:20,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 85 transitions, 293 flow [2025-01-10 01:11:20,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 85 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:20,861 INFO L231 Difference]: Finished difference. Result has 76 places, 82 transitions, 248 flow [2025-01-10 01:11:20,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2025-01-10 01:11:20,862 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2025-01-10 01:11:20,863 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 248 flow [2025-01-10 01:11:20,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:20,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:20,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:11:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:11:20,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash 681443035, now seen corresponding path program 1 times [2025-01-10 01:11:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335380774] [2025-01-10 01:11:20,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:11:20,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:11:20,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:20,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:21,109 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:11:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335380774] [2025-01-10 01:11:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335380774] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314893509] [2025-01-10 01:11:21,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:21,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:21,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:21,116 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:11:21,118 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:11:21,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:11:21,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:11:21,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:21,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:21,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:11:21,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:21,237 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:11:21,464 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:11:21,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:21,604 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:11:21,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314893509] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:21,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:11:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415273045] [2025-01-10 01:11:21,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:21,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:21,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:21,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:22,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-01-10 01:11:22,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 248 flow. Second operand has 11 states, 11 states have (on average 42.36363636363637) internal successors, (466), 11 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:22,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:22,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-01-10 01:11:22,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:22,546 INFO L124 PetriNetUnfolderBase]: 207/458 cut-off events. [2025-01-10 01:11:22,546 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:22,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 458 events. 207/458 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2077 event pairs, 124 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 748. Up to 322 conditions per place. [2025-01-10 01:11:22,551 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 41 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-01-10 01:11:22,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 340 flow [2025-01-10 01:11:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2025-01-10 01:11:22,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5958333333333333 [2025-01-10 01:11:22,554 INFO L175 Difference]: Start difference. First operand has 76 places, 82 transitions, 248 flow. Second operand 6 states and 286 transitions. [2025-01-10 01:11:22,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 340 flow [2025-01-10 01:11:22,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:11:22,558 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 258 flow [2025-01-10 01:11:22,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2025-01-10 01:11:22,559 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-01-10 01:11:22,560 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 258 flow [2025-01-10 01:11:22,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 42.36363636363637) internal successors, (466), 11 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:22,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:22,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:11:22,568 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:11:22,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:22,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:22,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:22,765 INFO L85 PathProgramCache]: Analyzing trace with hash -350100898, now seen corresponding path program 1 times [2025-01-10 01:11:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:22,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020189484] [2025-01-10 01:11:22,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:22,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:11:22,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:11:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:22,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:22,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020189484] [2025-01-10 01:11:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020189484] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:22,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59173018] [2025-01-10 01:11:22,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:22,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:22,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:22,973 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:11:22,976 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:11:23,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:11:23,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:11:23,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:23,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:23,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:11:23,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:23,053 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:11:23,167 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:11:23,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:11:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:23,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59173018] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:23,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:23,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-01-10 01:11:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067636738] [2025-01-10 01:11:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:23,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:23,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:23,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:23,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:11:23,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-01-10 01:11:23,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:23,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:23,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-01-10 01:11:23,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:23,678 INFO L124 PetriNetUnfolderBase]: 405/881 cut-off events. [2025-01-10 01:11:23,678 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:11:23,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 881 events. 405/881 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4780 event pairs, 248 based on Foata normal form. 3/686 useless extension candidates. Maximal degree in co-relation 811. Up to 310 conditions per place. [2025-01-10 01:11:23,683 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 62 selfloop transitions, 11 changer transitions 0/106 dead transitions. [2025-01-10 01:11:23,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 106 transitions, 471 flow [2025-01-10 01:11:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2025-01-10 01:11:23,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6975 [2025-01-10 01:11:23,685 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 258 flow. Second operand 5 states and 279 transitions. [2025-01-10 01:11:23,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 106 transitions, 471 flow [2025-01-10 01:11:23,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 441 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:23,689 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 269 flow [2025-01-10 01:11:23,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2025-01-10 01:11:23,690 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places. [2025-01-10 01:11:23,690 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 269 flow [2025-01-10 01:11:23,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:23,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:23,691 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:23,698 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:11:23,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:23,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:23,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:23,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1439491840, now seen corresponding path program 1 times [2025-01-10 01:11:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:23,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422602307] [2025-01-10 01:11:23,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:23,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:11:23,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:11:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422602307] [2025-01-10 01:11:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422602307] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857297221] [2025-01-10 01:11:23,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:23,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:23,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:23,996 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:11:23,999 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:11:24,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:11:24,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:11:24,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:24,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:24,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:11:24,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:24,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857297221] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:24,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:11:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123646385] [2025-01-10 01:11:24,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:24,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:11:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:24,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:11:24,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:11:24,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2025-01-10 01:11:24,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:24,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:24,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2025-01-10 01:11:24,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:24,692 INFO L124 PetriNetUnfolderBase]: 610/1332 cut-off events. [2025-01-10 01:11:24,692 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 01:11:24,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2408 conditions, 1332 events. 610/1332 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6843 event pairs, 372 based on Foata normal form. 3/1033 useless extension candidates. Maximal degree in co-relation 763. Up to 590 conditions per place. [2025-01-10 01:11:24,700 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 54 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2025-01-10 01:11:24,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 129 transitions, 645 flow [2025-01-10 01:11:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:11:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:11:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 500 transitions. [2025-01-10 01:11:24,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-01-10 01:11:24,702 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 269 flow. Second operand 9 states and 500 transitions. [2025-01-10 01:11:24,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 129 transitions, 645 flow [2025-01-10 01:11:24,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 129 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:24,706 INFO L231 Difference]: Finished difference. Result has 87 places, 103 transitions, 503 flow [2025-01-10 01:11:24,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=503, PETRI_PLACES=87, PETRI_TRANSITIONS=103} [2025-01-10 01:11:24,706 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 8 predicate places. [2025-01-10 01:11:24,706 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 503 flow [2025-01-10 01:11:24,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:24,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:24,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:24,715 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:11:24,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:24,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:24,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash 411819317, now seen corresponding path program 1 times [2025-01-10 01:11:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403969538] [2025-01-10 01:11:24,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:24,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:11:24,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:11:24,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:24,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:25,034 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:11:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403969538] [2025-01-10 01:11:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403969538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:25,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208224885] [2025-01-10 01:11:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:25,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:25,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:25,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:25,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:11:25,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:25,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:25,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:11:25,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:25,331 INFO L124 PetriNetUnfolderBase]: 874/1834 cut-off events. [2025-01-10 01:11:25,331 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-10 01:11:25,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3407 conditions, 1834 events. 874/1834 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9766 event pairs, 496 based on Foata normal form. 2/1406 useless extension candidates. Maximal degree in co-relation 1300. Up to 781 conditions per place. [2025-01-10 01:11:25,356 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 71 selfloop transitions, 27 changer transitions 1/134 dead transitions. [2025-01-10 01:11:25,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 134 transitions, 789 flow [2025-01-10 01:11:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-01-10 01:11:25,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7145833333333333 [2025-01-10 01:11:25,358 INFO L175 Difference]: Start difference. First operand has 87 places, 103 transitions, 503 flow. Second operand 6 states and 343 transitions. [2025-01-10 01:11:25,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 134 transitions, 789 flow [2025-01-10 01:11:25,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 692 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:25,366 INFO L231 Difference]: Finished difference. Result has 90 places, 105 transitions, 480 flow [2025-01-10 01:11:25,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=90, PETRI_TRANSITIONS=105} [2025-01-10 01:11:25,368 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2025-01-10 01:11:25,368 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 105 transitions, 480 flow [2025-01-10 01:11:25,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:25,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:25,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:11:25,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:11:25,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:25,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1120218888, now seen corresponding path program 2 times [2025-01-10 01:11:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581560767] [2025-01-10 01:11:25,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:25,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:11:25,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:25,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:25,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:25,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581560767] [2025-01-10 01:11:25,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581560767] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593997986] [2025-01-10 01:11:25,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:25,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:25,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:25,617 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:11:25,620 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:11:25,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:11:25,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:25,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:25,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:25,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:11:25,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:25,704 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:11:25,820 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:11:25,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:11:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:25,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593997986] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:26,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-01-10 01:11:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478565453] [2025-01-10 01:11:26,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:11:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:26,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:11:26,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:11:27,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-01-10 01:11:27,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 105 transitions, 480 flow. Second operand has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:27,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:27,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-01-10 01:11:27,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:28,698 INFO L124 PetriNetUnfolderBase]: 760/1832 cut-off events. [2025-01-10 01:11:28,698 INFO L125 PetriNetUnfolderBase]: For 474/498 co-relation queries the response was YES. [2025-01-10 01:11:28,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1832 events. 760/1832 cut-off events. For 474/498 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11203 event pairs, 496 based on Foata normal form. 24/1411 useless extension candidates. Maximal degree in co-relation 1585. Up to 825 conditions per place. [2025-01-10 01:11:28,711 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 72 selfloop transitions, 65 changer transitions 0/170 dead transitions. [2025-01-10 01:11:28,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 170 transitions, 1092 flow [2025-01-10 01:11:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:11:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:11:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 814 transitions. [2025-01-10 01:11:28,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6359375 [2025-01-10 01:11:28,717 INFO L175 Difference]: Start difference. First operand has 90 places, 105 transitions, 480 flow. Second operand 16 states and 814 transitions. [2025-01-10 01:11:28,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 170 transitions, 1092 flow [2025-01-10 01:11:28,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 170 transitions, 1035 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:28,726 INFO L231 Difference]: Finished difference. Result has 109 places, 135 transitions, 860 flow [2025-01-10 01:11:28,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=860, PETRI_PLACES=109, PETRI_TRANSITIONS=135} [2025-01-10 01:11:28,726 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-01-10 01:11:28,727 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 135 transitions, 860 flow [2025-01-10 01:11:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:28,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:28,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:28,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:11:28,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:11:28,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:28,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash 588305847, now seen corresponding path program 1 times [2025-01-10 01:11:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:28,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026815922] [2025-01-10 01:11:28,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:28,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:11:28,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:11:28,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:28,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:29,028 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:11:29,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:29,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026815922] [2025-01-10 01:11:29,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026815922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:29,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:29,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:11:29,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626293287] [2025-01-10 01:11:29,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:29,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:11:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:29,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:11:29,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:11:29,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:11:29,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 135 transitions, 860 flow. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:29,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:29,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:11:29,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:29,347 INFO L124 PetriNetUnfolderBase]: 832/1802 cut-off events. [2025-01-10 01:11:29,347 INFO L125 PetriNetUnfolderBase]: For 640/702 co-relation queries the response was YES. [2025-01-10 01:11:29,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 1802 events. 832/1802 cut-off events. For 640/702 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9995 event pairs, 496 based on Foata normal form. 0/1392 useless extension candidates. Maximal degree in co-relation 3809. Up to 822 conditions per place. [2025-01-10 01:11:29,359 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 91 selfloop transitions, 32 changer transitions 3/161 dead transitions. [2025-01-10 01:11:29,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 161 transitions, 1204 flow [2025-01-10 01:11:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 339 transitions. [2025-01-10 01:11:29,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.70625 [2025-01-10 01:11:29,361 INFO L175 Difference]: Start difference. First operand has 109 places, 135 transitions, 860 flow. Second operand 6 states and 339 transitions. [2025-01-10 01:11:29,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 161 transitions, 1204 flow [2025-01-10 01:11:29,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 161 transitions, 1126 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:29,368 INFO L231 Difference]: Finished difference. Result has 112 places, 137 transitions, 863 flow [2025-01-10 01:11:29,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=863, PETRI_PLACES=112, PETRI_TRANSITIONS=137} [2025-01-10 01:11:29,369 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 33 predicate places. [2025-01-10 01:11:29,369 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 137 transitions, 863 flow [2025-01-10 01:11:29,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:29,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:29,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:29,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:11:29,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:29,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1587734248, now seen corresponding path program 1 times [2025-01-10 01:11:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857805910] [2025-01-10 01:11:29,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:29,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:11:29,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:11:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:29,466 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:11:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:29,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857805910] [2025-01-10 01:11:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857805910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:29,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:29,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:11:29,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136618231] [2025-01-10 01:11:29,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:29,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:11:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:29,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:11:29,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:11:29,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:11:29,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 137 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:29,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:29,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:11:29,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:29,779 INFO L124 PetriNetUnfolderBase]: 643/1487 cut-off events. [2025-01-10 01:11:29,780 INFO L125 PetriNetUnfolderBase]: For 760/868 co-relation queries the response was YES. [2025-01-10 01:11:29,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1487 events. 643/1487 cut-off events. For 760/868 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8371 event pairs, 411 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 3316. Up to 790 conditions per place. [2025-01-10 01:11:29,789 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 69 selfloop transitions, 24 changer transitions 30/158 dead transitions. [2025-01-10 01:11:29,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 158 transitions, 1199 flow [2025-01-10 01:11:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:11:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:11:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 336 transitions. [2025-01-10 01:11:29,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:11:29,791 INFO L175 Difference]: Start difference. First operand has 112 places, 137 transitions, 863 flow. Second operand 6 states and 336 transitions. [2025-01-10 01:11:29,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 158 transitions, 1199 flow [2025-01-10 01:11:29,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 158 transitions, 1142 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:29,797 INFO L231 Difference]: Finished difference. Result has 116 places, 125 transitions, 775 flow [2025-01-10 01:11:29,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=775, PETRI_PLACES=116, PETRI_TRANSITIONS=125} [2025-01-10 01:11:29,798 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 37 predicate places. [2025-01-10 01:11:29,798 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 125 transitions, 775 flow [2025-01-10 01:11:29,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:29,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:29,799 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1] [2025-01-10 01:11:29,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:11:29,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:29,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1312439022, now seen corresponding path program 3 times [2025-01-10 01:11:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90768161] [2025-01-10 01:11:29,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:29,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-01-10 01:11:29,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 14 statements. [2025-01-10 01:11:29,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:29,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:11:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90768161] [2025-01-10 01:11:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90768161] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189430738] [2025-01-10 01:11:29,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:29,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:29,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:29,947 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:11:29,950 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:11:29,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-01-10 01:11:30,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 14 statements. [2025-01-10 01:11:30,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:30,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:30,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:11:30,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:30,024 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:11:30,114 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:11:30,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2025-01-10 01:11:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:11:30,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:11:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189430738] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:30,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:30,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-01-10 01:11:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551020586] [2025-01-10 01:11:30,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:11:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:30,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:11:30,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:11:31,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-01-10 01:11:31,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 125 transitions, 775 flow. Second operand has 16 states, 16 states have (on average 42.8125) internal successors, (685), 16 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:31,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:31,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-01-10 01:11:31,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:31,820 INFO L124 PetriNetUnfolderBase]: 412/983 cut-off events. [2025-01-10 01:11:31,820 INFO L125 PetriNetUnfolderBase]: For 455/545 co-relation queries the response was YES. [2025-01-10 01:11:31,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 983 events. 412/983 cut-off events. For 455/545 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5171 event pairs, 248 based on Foata normal form. 6/743 useless extension candidates. Maximal degree in co-relation 2249. Up to 589 conditions per place. [2025-01-10 01:11:31,830 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 26 selfloop transitions, 66 changer transitions 0/125 dead transitions. [2025-01-10 01:11:31,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 125 transitions, 953 flow [2025-01-10 01:11:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 331 transitions. [2025-01-10 01:11:31,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5910714285714286 [2025-01-10 01:11:31,832 INFO L175 Difference]: Start difference. First operand has 116 places, 125 transitions, 775 flow. Second operand 7 states and 331 transitions. [2025-01-10 01:11:31,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 125 transitions, 953 flow [2025-01-10 01:11:31,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 125 transitions, 797 flow, removed 16 selfloop flow, removed 16 redundant places. [2025-01-10 01:11:31,841 INFO L231 Difference]: Finished difference. Result has 96 places, 125 transitions, 815 flow [2025-01-10 01:11:31,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=815, PETRI_PLACES=96, PETRI_TRANSITIONS=125} [2025-01-10 01:11:31,843 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 17 predicate places. [2025-01-10 01:11:31,843 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 125 transitions, 815 flow [2025-01-10 01:11:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.8125) internal successors, (685), 16 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:31,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:31,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:31,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:11:32,044 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,SelfDestructingSolverStorable10 [2025-01-10 01:11:32,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:32,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 614861986, now seen corresponding path program 1 times [2025-01-10 01:11:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:32,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970477667] [2025-01-10 01:11:32,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:32,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:32,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:11:32,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:11:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:32,280 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:11:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970477667] [2025-01-10 01:11:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970477667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:32,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:32,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:11:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140795968] [2025-01-10 01:11:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:32,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:32,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:32,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:32,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-01-10 01:11:32,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 125 transitions, 815 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:32,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:32,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-01-10 01:11:32,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:32,586 INFO L124 PetriNetUnfolderBase]: 872/1697 cut-off events. [2025-01-10 01:11:32,586 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 01:11:32,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3395 conditions, 1697 events. 872/1697 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9439 event pairs, 612 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 3104. Up to 1245 conditions per place. [2025-01-10 01:11:32,599 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 86 selfloop transitions, 9 changer transitions 0/122 dead transitions. [2025-01-10 01:11:32,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 122 transitions, 999 flow [2025-01-10 01:11:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2025-01-10 01:11:32,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-01-10 01:11:32,601 INFO L175 Difference]: Start difference. First operand has 96 places, 125 transitions, 815 flow. Second operand 5 states and 214 transitions. [2025-01-10 01:11:32,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 122 transitions, 999 flow [2025-01-10 01:11:32,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 122 transitions, 960 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:32,606 INFO L231 Difference]: Finished difference. Result has 94 places, 122 transitions, 788 flow [2025-01-10 01:11:32,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=788, PETRI_PLACES=94, PETRI_TRANSITIONS=122} [2025-01-10 01:11:32,607 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2025-01-10 01:11:32,608 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 122 transitions, 788 flow [2025-01-10 01:11:32,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:32,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:32,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:32,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:11:32,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:32,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 614861987, now seen corresponding path program 1 times [2025-01-10 01:11:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:32,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805741397] [2025-01-10 01:11:32,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:32,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:11:32,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:11:32,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:32,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805741397] [2025-01-10 01:11:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805741397] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:32,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305605358] [2025-01-10 01:11:32,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:32,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:32,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:32,966 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:11:32,968 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:11:33,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:11:33,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:11:33,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:33,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:33,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-10 01:11:33,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:33,064 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:11:33,107 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:11:33,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 01:11:33,228 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-10 01:11:33,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2025-01-10 01:11:33,303 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-10 01:11:33,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2025-01-10 01:11:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:11:33,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:11:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305605358] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:33,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 15 [2025-01-10 01:11:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097130464] [2025-01-10 01:11:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:33,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:11:34,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-01-10 01:11:34,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 122 transitions, 788 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:34,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:34,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-01-10 01:11:34,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:34,803 INFO L124 PetriNetUnfolderBase]: 818/1875 cut-off events. [2025-01-10 01:11:34,803 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-01-10 01:11:34,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 1875 events. 818/1875 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11952 event pairs, 338 based on Foata normal form. 0/1399 useless extension candidates. Maximal degree in co-relation 3187. Up to 759 conditions per place. [2025-01-10 01:11:34,812 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 91 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2025-01-10 01:11:34,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 135 transitions, 1030 flow [2025-01-10 01:11:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2025-01-10 01:11:34,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-10 01:11:34,814 INFO L175 Difference]: Start difference. First operand has 94 places, 122 transitions, 788 flow. Second operand 7 states and 352 transitions. [2025-01-10 01:11:34,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 135 transitions, 1030 flow [2025-01-10 01:11:34,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 135 transitions, 1017 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:34,819 INFO L231 Difference]: Finished difference. Result has 99 places, 124 transitions, 830 flow [2025-01-10 01:11:34,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=830, PETRI_PLACES=99, PETRI_TRANSITIONS=124} [2025-01-10 01:11:34,820 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-01-10 01:11:34,820 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 124 transitions, 830 flow [2025-01-10 01:11:34,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:34,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:34,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:34,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:11:35,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:11:35,022 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:35,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:35,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1880853082, now seen corresponding path program 1 times [2025-01-10 01:11:35,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430069083] [2025-01-10 01:11:35,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:35,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:35,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:11:35,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:11:35,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:35,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:35,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430069083] [2025-01-10 01:11:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430069083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226413647] [2025-01-10 01:11:35,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:35,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:35,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:35,359 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:11:35,361 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:11:35,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:11:35,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:11:35,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:35,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:35,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:11:35,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:35,448 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:11:35,500 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:11:35,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2025-01-10 01:11:35,584 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-10 01:11:35,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2025-01-10 01:11:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:11:35,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:11:35,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226413647] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:35,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:35,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2025-01-10 01:11:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173981479] [2025-01-10 01:11:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:35,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:35,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:35,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:11:36,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-01-10 01:11:36,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 124 transitions, 830 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:36,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:36,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-01-10 01:11:36,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:36,634 INFO L124 PetriNetUnfolderBase]: 818/1835 cut-off events. [2025-01-10 01:11:36,634 INFO L125 PetriNetUnfolderBase]: For 309/393 co-relation queries the response was YES. [2025-01-10 01:11:36,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 1835 events. 818/1835 cut-off events. For 309/393 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11436 event pairs, 338 based on Foata normal form. 42/1511 useless extension candidates. Maximal degree in co-relation 3579. Up to 759 conditions per place. [2025-01-10 01:11:36,642 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 91 selfloop transitions, 16 changer transitions 0/136 dead transitions. [2025-01-10 01:11:36,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 1070 flow [2025-01-10 01:11:36,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2025-01-10 01:11:36,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-10 01:11:36,644 INFO L175 Difference]: Start difference. First operand has 99 places, 124 transitions, 830 flow. Second operand 7 states and 352 transitions. [2025-01-10 01:11:36,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 1070 flow [2025-01-10 01:11:36,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 136 transitions, 1057 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:36,648 INFO L231 Difference]: Finished difference. Result has 104 places, 125 transitions, 868 flow [2025-01-10 01:11:36,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=868, PETRI_PLACES=104, PETRI_TRANSITIONS=125} [2025-01-10 01:11:36,649 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 25 predicate places. [2025-01-10 01:11:36,649 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 125 transitions, 868 flow [2025-01-10 01:11:36,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:36,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:36,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:36,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:11:36,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:36,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:36,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1880853081, now seen corresponding path program 1 times [2025-01-10 01:11:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:36,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796447241] [2025-01-10 01:11:36,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:36,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:36,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:11:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:11:36,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:36,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:11:36,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:36,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796447241] [2025-01-10 01:11:36,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796447241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:36,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:36,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700681906] [2025-01-10 01:11:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:36,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:36,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:36,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:37,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-01-10 01:11:37,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 125 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:37,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:37,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-01-10 01:11:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:37,293 INFO L124 PetriNetUnfolderBase]: 1152/2273 cut-off events. [2025-01-10 01:11:37,293 INFO L125 PetriNetUnfolderBase]: For 3078/3152 co-relation queries the response was YES. [2025-01-10 01:11:37,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 2273 events. 1152/2273 cut-off events. For 3078/3152 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13849 event pairs, 772 based on Foata normal form. 146/2201 useless extension candidates. Maximal degree in co-relation 5672. Up to 1609 conditions per place. [2025-01-10 01:11:37,304 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 86 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2025-01-10 01:11:37,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 122 transitions, 1056 flow [2025-01-10 01:11:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2025-01-10 01:11:37,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-01-10 01:11:37,306 INFO L175 Difference]: Start difference. First operand has 104 places, 125 transitions, 868 flow. Second operand 5 states and 214 transitions. [2025-01-10 01:11:37,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 122 transitions, 1056 flow [2025-01-10 01:11:37,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 122 transitions, 1033 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:37,312 INFO L231 Difference]: Finished difference. Result has 100 places, 122 transitions, 861 flow [2025-01-10 01:11:37,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=861, PETRI_PLACES=100, PETRI_TRANSITIONS=122} [2025-01-10 01:11:37,312 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2025-01-10 01:11:37,312 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 122 transitions, 861 flow [2025-01-10 01:11:37,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:37,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:37,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:37,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:11:37,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:37,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1856184859, now seen corresponding path program 1 times [2025-01-10 01:11:37,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:37,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787579586] [2025-01-10 01:11:37,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:37,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:11:37,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:11:37,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:37,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787579586] [2025-01-10 01:11:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787579586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373330421] [2025-01-10 01:11:37,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:37,723 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:11:37,725 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:11:37,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:11:37,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:11:37,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:37,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:37,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-10 01:11:37,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:37,829 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:11:37,866 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:11:37,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 01:11:37,967 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-10 01:11:37,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2025-01-10 01:11:38,047 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-10 01:11:38,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2025-01-10 01:11:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:11:38,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:11:38,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373330421] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:38,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:38,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 16 [2025-01-10 01:11:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411619580] [2025-01-10 01:11:38,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:38,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:38,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:38,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:11:38,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-01-10 01:11:38,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 122 transitions, 861 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:38,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:38,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-01-10 01:11:38,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:39,126 INFO L124 PetriNetUnfolderBase]: 1096/2249 cut-off events. [2025-01-10 01:11:39,126 INFO L125 PetriNetUnfolderBase]: For 2475/2907 co-relation queries the response was YES. [2025-01-10 01:11:39,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 2249 events. 1096/2249 cut-off events. For 2475/2907 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14332 event pairs, 468 based on Foata normal form. 0/1851 useless extension candidates. Maximal degree in co-relation 5185. Up to 993 conditions per place. [2025-01-10 01:11:39,139 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 92 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2025-01-10 01:11:39,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 135 transitions, 1128 flow [2025-01-10 01:11:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2025-01-10 01:11:39,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2025-01-10 01:11:39,141 INFO L175 Difference]: Start difference. First operand has 100 places, 122 transitions, 861 flow. Second operand 7 states and 351 transitions. [2025-01-10 01:11:39,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 135 transitions, 1128 flow [2025-01-10 01:11:39,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 135 transitions, 1111 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:39,146 INFO L231 Difference]: Finished difference. Result has 105 places, 124 transitions, 899 flow [2025-01-10 01:11:39,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=899, PETRI_PLACES=105, PETRI_TRANSITIONS=124} [2025-01-10 01:11:39,147 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 26 predicate places. [2025-01-10 01:11:39,147 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 124 transitions, 899 flow [2025-01-10 01:11:39,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:39,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:39,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:39,156 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:11:39,353 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,SelfDestructingSolverStorable15 [2025-01-10 01:11:39,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:39,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1823095931, now seen corresponding path program 1 times [2025-01-10 01:11:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946417320] [2025-01-10 01:11:39,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:39,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:11:39,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:11:39,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:39,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946417320] [2025-01-10 01:11:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946417320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461306040] [2025-01-10 01:11:39,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:39,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:39,571 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:11:39,573 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:11:39,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:11:39,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:11:39,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:39,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:39,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 01:11:39,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:39,675 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:11:39,729 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:11:39,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2025-01-10 01:11:39,810 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-10 01:11:39,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2025-01-10 01:11:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:39,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461306040] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 15 [2025-01-10 01:11:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54159227] [2025-01-10 01:11:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:40,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:40,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:40,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:11:40,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:11:40,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 124 transitions, 899 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:40,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:40,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:11:40,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:40,733 INFO L124 PetriNetUnfolderBase]: 990/2077 cut-off events. [2025-01-10 01:11:40,734 INFO L125 PetriNetUnfolderBase]: For 2650/3022 co-relation queries the response was YES. [2025-01-10 01:11:40,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5935 conditions, 2077 events. 990/2077 cut-off events. For 2650/3022 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12856 event pairs, 414 based on Foata normal form. 164/1967 useless extension candidates. Maximal degree in co-relation 5633. Up to 1115 conditions per place. [2025-01-10 01:11:40,748 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 90 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2025-01-10 01:11:40,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 1164 flow [2025-01-10 01:11:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:11:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:11:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2025-01-10 01:11:40,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.628125 [2025-01-10 01:11:40,751 INFO L175 Difference]: Start difference. First operand has 105 places, 124 transitions, 899 flow. Second operand 8 states and 402 transitions. [2025-01-10 01:11:40,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 1164 flow [2025-01-10 01:11:40,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 1145 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:40,757 INFO L231 Difference]: Finished difference. Result has 109 places, 125 transitions, 932 flow [2025-01-10 01:11:40,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=932, PETRI_PLACES=109, PETRI_TRANSITIONS=125} [2025-01-10 01:11:40,758 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-01-10 01:11:40,758 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 125 transitions, 932 flow [2025-01-10 01:11:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:40,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:40,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:40,767 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:11:40,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:40,963 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:40,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1823095932, now seen corresponding path program 1 times [2025-01-10 01:11:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:40,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826179554] [2025-01-10 01:11:40,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:40,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:40,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:11:40,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:11:40,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:40,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:11:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826179554] [2025-01-10 01:11:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826179554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:41,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904459233] [2025-01-10 01:11:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:41,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:41,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:41,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:41,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2025-01-10 01:11:41,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 125 transitions, 932 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:41,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:41,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2025-01-10 01:11:41,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:41,296 INFO L124 PetriNetUnfolderBase]: 770/1479 cut-off events. [2025-01-10 01:11:41,297 INFO L125 PetriNetUnfolderBase]: For 4213/4651 co-relation queries the response was YES. [2025-01-10 01:11:41,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5068 conditions, 1479 events. 770/1479 cut-off events. For 4213/4651 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7849 event pairs, 468 based on Foata normal form. 112/1377 useless extension candidates. Maximal degree in co-relation 4760. Up to 1063 conditions per place. [2025-01-10 01:11:41,307 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 85 selfloop transitions, 11 changer transitions 0/123 dead transitions. [2025-01-10 01:11:41,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 123 transitions, 1120 flow [2025-01-10 01:11:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-01-10 01:11:41,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565 [2025-01-10 01:11:41,309 INFO L175 Difference]: Start difference. First operand has 109 places, 125 transitions, 932 flow. Second operand 5 states and 226 transitions. [2025-01-10 01:11:41,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 123 transitions, 1120 flow [2025-01-10 01:11:41,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 1082 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:41,316 INFO L231 Difference]: Finished difference. Result has 104 places, 123 transitions, 912 flow [2025-01-10 01:11:41,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=912, PETRI_PLACES=104, PETRI_TRANSITIONS=123} [2025-01-10 01:11:41,317 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 25 predicate places. [2025-01-10 01:11:41,317 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 123 transitions, 912 flow [2025-01-10 01:11:41,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:41,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:41,318 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:11:41,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:11:41,318 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:41,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1707155100, now seen corresponding path program 1 times [2025-01-10 01:11:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14541445] [2025-01-10 01:11:41,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:41,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:11:41,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:11:41,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:41,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:11:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14541445] [2025-01-10 01:11:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14541445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535781243] [2025-01-10 01:11:41,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:41,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:41,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:41,584 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:11:41,586 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:11:41,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:11:41,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:11:41,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:41,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:41,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:11:41,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:41,686 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:11:41,742 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:11:41,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2025-01-10 01:11:41,812 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-10 01:11:41,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2025-01-10 01:11:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:42,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535781243] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2025-01-10 01:11:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821773022] [2025-01-10 01:11:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:42,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:42,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:11:42,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-01-10 01:11:42,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 123 transitions, 912 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:42,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:42,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-01-10 01:11:42,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:43,065 INFO L124 PetriNetUnfolderBase]: 1192/2281 cut-off events. [2025-01-10 01:11:43,065 INFO L125 PetriNetUnfolderBase]: For 3750/4350 co-relation queries the response was YES. [2025-01-10 01:11:43,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6912 conditions, 2281 events. 1192/2281 cut-off events. For 3750/4350 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13584 event pairs, 468 based on Foata normal form. 46/1995 useless extension candidates. Maximal degree in co-relation 6605. Up to 1061 conditions per place. [2025-01-10 01:11:43,074 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 94 selfloop transitions, 16 changer transitions 0/136 dead transitions. [2025-01-10 01:11:43,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 1194 flow [2025-01-10 01:11:43,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2025-01-10 01:11:43,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2025-01-10 01:11:43,076 INFO L175 Difference]: Start difference. First operand has 104 places, 123 transitions, 912 flow. Second operand 7 states and 351 transitions. [2025-01-10 01:11:43,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 1194 flow [2025-01-10 01:11:43,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 136 transitions, 1177 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:43,082 INFO L231 Difference]: Finished difference. Result has 109 places, 124 transitions, 946 flow [2025-01-10 01:11:43,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=946, PETRI_PLACES=109, PETRI_TRANSITIONS=124} [2025-01-10 01:11:43,083 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-01-10 01:11:43,083 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 124 transitions, 946 flow [2025-01-10 01:11:43,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:43,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:43,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:43,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:43,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:43,288 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:43,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1382199866, now seen corresponding path program 1 times [2025-01-10 01:11:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:43,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859504027] [2025-01-10 01:11:43,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:43,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:11:43,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:11:43,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:43,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:43,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859504027] [2025-01-10 01:11:43,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859504027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:43,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:43,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:11:43,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265217927] [2025-01-10 01:11:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:43,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:43,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:43,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:43,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2025-01-10 01:11:43,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 124 transitions, 946 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:43,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:43,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2025-01-10 01:11:43,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:43,651 INFO L124 PetriNetUnfolderBase]: 778/1517 cut-off events. [2025-01-10 01:11:43,651 INFO L125 PetriNetUnfolderBase]: For 4099/4511 co-relation queries the response was YES. [2025-01-10 01:11:43,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 1517 events. 778/1517 cut-off events. For 4099/4511 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8271 event pairs, 468 based on Foata normal form. 28/1367 useless extension candidates. Maximal degree in co-relation 5104. Up to 1061 conditions per place. [2025-01-10 01:11:43,660 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 89 selfloop transitions, 6 changer transitions 0/121 dead transitions. [2025-01-10 01:11:43,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 121 transitions, 1130 flow [2025-01-10 01:11:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-01-10 01:11:43,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875 [2025-01-10 01:11:43,662 INFO L175 Difference]: Start difference. First operand has 109 places, 124 transitions, 946 flow. Second operand 4 states and 188 transitions. [2025-01-10 01:11:43,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 121 transitions, 1130 flow [2025-01-10 01:11:43,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 121 transitions, 1107 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:43,667 INFO L231 Difference]: Finished difference. Result has 104 places, 121 transitions, 929 flow [2025-01-10 01:11:43,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=929, PETRI_PLACES=104, PETRI_TRANSITIONS=121} [2025-01-10 01:11:43,668 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 25 predicate places. [2025-01-10 01:11:43,668 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 121 transitions, 929 flow [2025-01-10 01:11:43,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:43,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:43,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:43,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:11:43,669 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:43,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1396192762, now seen corresponding path program 1 times [2025-01-10 01:11:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719654081] [2025-01-10 01:11:43,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:43,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:11:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:11:43,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:43,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719654081] [2025-01-10 01:11:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719654081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016120836] [2025-01-10 01:11:43,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:43,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:43,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:43,975 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:43,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:11:44,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:11:44,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:11:44,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:44,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:44,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-10 01:11:44,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:44,084 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:11:44,161 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:11:44,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 01:11:44,273 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-10 01:11:44,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2025-01-10 01:11:44,343 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-10 01:11:44,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2025-01-10 01:11:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:44,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:45,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016120836] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:45,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:45,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2025-01-10 01:11:45,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304611704] [2025-01-10 01:11:45,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:45,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:11:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:45,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:11:45,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:11:46,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-01-10 01:11:46,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 121 transitions, 929 flow. Second operand has 24 states, 24 states have (on average 31.583333333333332) internal successors, (758), 24 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:46,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:46,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-01-10 01:11:46,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:48,282 INFO L124 PetriNetUnfolderBase]: 2430/4115 cut-off events. [2025-01-10 01:11:48,282 INFO L125 PetriNetUnfolderBase]: For 9913/10812 co-relation queries the response was YES. [2025-01-10 01:11:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13403 conditions, 4115 events. 2430/4115 cut-off events. For 9913/10812 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 24734 event pairs, 776 based on Foata normal form. 0/3769 useless extension candidates. Maximal degree in co-relation 13091. Up to 751 conditions per place. [2025-01-10 01:11:48,300 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 145 selfloop transitions, 52 changer transitions 0/216 dead transitions. [2025-01-10 01:11:48,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 216 transitions, 1892 flow [2025-01-10 01:11:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:11:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:11:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 696 transitions. [2025-01-10 01:11:48,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45789473684210524 [2025-01-10 01:11:48,302 INFO L175 Difference]: Start difference. First operand has 104 places, 121 transitions, 929 flow. Second operand 19 states and 696 transitions. [2025-01-10 01:11:48,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 216 transitions, 1892 flow [2025-01-10 01:11:48,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 216 transitions, 1885 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:48,311 INFO L231 Difference]: Finished difference. Result has 119 places, 124 transitions, 1032 flow [2025-01-10 01:11:48,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1032, PETRI_PLACES=119, PETRI_TRANSITIONS=124} [2025-01-10 01:11:48,311 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 40 predicate places. [2025-01-10 01:11:48,311 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 124 transitions, 1032 flow [2025-01-10 01:11:48,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 31.583333333333332) internal successors, (758), 24 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:48,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:48,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:48,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:11:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 01:11:48,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1382199865, now seen corresponding path program 1 times [2025-01-10 01:11:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775094132] [2025-01-10 01:11:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:48,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:11:48,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:11:48,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775094132] [2025-01-10 01:11:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775094132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655229028] [2025-01-10 01:11:48,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:48,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:48,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:48,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:11:48,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:11:48,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:11:48,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:48,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:48,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:11:48,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:48,800 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:11:48,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 01:11:48,851 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:11:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:48,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:11:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655229028] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:48,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:48,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2025-01-10 01:11:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646821665] [2025-01-10 01:11:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:48,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:48,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:11:49,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:11:49,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 124 transitions, 1032 flow. Second operand has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:49,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:49,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:11:49,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:49,432 INFO L124 PetriNetUnfolderBase]: 1012/2056 cut-off events. [2025-01-10 01:11:49,433 INFO L125 PetriNetUnfolderBase]: For 4154/4608 co-relation queries the response was YES. [2025-01-10 01:11:49,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7260 conditions, 2056 events. 1012/2056 cut-off events. For 4154/4608 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 12188 event pairs, 468 based on Foata normal form. 82/1953 useless extension candidates. Maximal degree in co-relation 6925. Up to 1131 conditions per place. [2025-01-10 01:11:49,443 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 102 selfloop transitions, 13 changer transitions 0/140 dead transitions. [2025-01-10 01:11:49,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 140 transitions, 1349 flow [2025-01-10 01:11:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 357 transitions. [2025-01-10 01:11:49,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6375 [2025-01-10 01:11:49,444 INFO L175 Difference]: Start difference. First operand has 119 places, 124 transitions, 1032 flow. Second operand 7 states and 357 transitions. [2025-01-10 01:11:49,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 140 transitions, 1349 flow [2025-01-10 01:11:49,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 140 transitions, 1289 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:49,450 INFO L231 Difference]: Finished difference. Result has 119 places, 125 transitions, 1020 flow [2025-01-10 01:11:49,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1020, PETRI_PLACES=119, PETRI_TRANSITIONS=125} [2025-01-10 01:11:49,450 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 40 predicate places. [2025-01-10 01:11:49,451 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 125 transitions, 1020 flow [2025-01-10 01:11:49,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:49,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:49,451 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] [2025-01-10 01:11:49,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:49,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:49,652 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:49,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 351491210, now seen corresponding path program 1 times [2025-01-10 01:11:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874493744] [2025-01-10 01:11:49,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:49,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:11:49,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:11:49,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:49,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:49,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:49,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874493744] [2025-01-10 01:11:49,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874493744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:49,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774942596] [2025-01-10 01:11:49,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:49,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:49,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:49,747 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:49,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:11:49,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:11:49,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:11:49,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:49,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:49,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:49,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:49,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:49,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774942596] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:49,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:49,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:11:49,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230937199] [2025-01-10 01:11:49,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:49,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:11:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:49,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:11:49,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:11:50,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:11:50,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 125 transitions, 1020 flow. Second operand has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:50,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:50,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:11:50,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:50,426 INFO L124 PetriNetUnfolderBase]: 1056/1934 cut-off events. [2025-01-10 01:11:50,426 INFO L125 PetriNetUnfolderBase]: For 6185/6531 co-relation queries the response was YES. [2025-01-10 01:11:50,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7452 conditions, 1934 events. 1056/1934 cut-off events. For 6185/6531 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10033 event pairs, 468 based on Foata normal form. 34/1804 useless extension candidates. Maximal degree in co-relation 7122. Up to 829 conditions per place. [2025-01-10 01:11:50,433 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 86 selfloop transitions, 61 changer transitions 0/172 dead transitions. [2025-01-10 01:11:50,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 172 transitions, 1573 flow [2025-01-10 01:11:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:11:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:11:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 545 transitions. [2025-01-10 01:11:50,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-01-10 01:11:50,435 INFO L175 Difference]: Start difference. First operand has 119 places, 125 transitions, 1020 flow. Second operand 10 states and 545 transitions. [2025-01-10 01:11:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 172 transitions, 1573 flow [2025-01-10 01:11:50,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 172 transitions, 1524 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:50,441 INFO L231 Difference]: Finished difference. Result has 125 places, 129 transitions, 1167 flow [2025-01-10 01:11:50,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1167, PETRI_PLACES=125, PETRI_TRANSITIONS=129} [2025-01-10 01:11:50,442 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 46 predicate places. [2025-01-10 01:11:50,442 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 129 transitions, 1167 flow [2025-01-10 01:11:50,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:50,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:50,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:50,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:50,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:50,644 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:50,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:50,644 INFO L85 PathProgramCache]: Analyzing trace with hash -332301969, now seen corresponding path program 1 times [2025-01-10 01:11:50,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:50,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563833582] [2025-01-10 01:11:50,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:50,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:11:50,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:11:50,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:50,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:11:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563833582] [2025-01-10 01:11:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563833582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513148891] [2025-01-10 01:11:51,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:51,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:51,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:51,048 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:51,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:11:51,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:11:51,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:11:51,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:51,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:51,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 01:11:51,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:51,188 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:11:51,259 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:11:51,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2025-01-10 01:11:51,342 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-10 01:11:51,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2025-01-10 01:11:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:51,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:51,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513148891] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:51,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:51,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 27 [2025-01-10 01:11:51,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175162918] [2025-01-10 01:11:51,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:51,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 01:11:51,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:51,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 01:11:51,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:11:54,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-01-10 01:11:54,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 129 transitions, 1167 flow. Second operand has 29 states, 29 states have (on average 34.172413793103445) internal successors, (991), 29 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:54,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:54,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-01-10 01:11:54,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:55,109 INFO L124 PetriNetUnfolderBase]: 2298/3995 cut-off events. [2025-01-10 01:11:55,109 INFO L125 PetriNetUnfolderBase]: For 13938/14516 co-relation queries the response was YES. [2025-01-10 01:11:55,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14957 conditions, 3995 events. 2298/3995 cut-off events. For 13938/14516 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 23588 event pairs, 708 based on Foata normal form. 0/3815 useless extension candidates. Maximal degree in co-relation 14591. Up to 789 conditions per place. [2025-01-10 01:11:55,133 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 148 selfloop transitions, 46 changer transitions 0/212 dead transitions. [2025-01-10 01:11:55,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 212 transitions, 2114 flow [2025-01-10 01:11:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:11:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:11:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 773 transitions. [2025-01-10 01:11:55,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.483125 [2025-01-10 01:11:55,135 INFO L175 Difference]: Start difference. First operand has 125 places, 129 transitions, 1167 flow. Second operand 20 states and 773 transitions. [2025-01-10 01:11:55,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 212 transitions, 2114 flow [2025-01-10 01:11:55,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 212 transitions, 1995 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:55,146 INFO L231 Difference]: Finished difference. Result has 137 places, 128 transitions, 1142 flow [2025-01-10 01:11:55,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1142, PETRI_PLACES=137, PETRI_TRANSITIONS=128} [2025-01-10 01:11:55,147 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 58 predicate places. [2025-01-10 01:11:55,147 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 128 transitions, 1142 flow [2025-01-10 01:11:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 34.172413793103445) internal successors, (991), 29 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:55,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:55,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:55,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 01:11:55,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:11:55,348 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:55,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1711425752, now seen corresponding path program 1 times [2025-01-10 01:11:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761724843] [2025-01-10 01:11:55,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:55,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:55,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:55,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:55,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:55,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761724843] [2025-01-10 01:11:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761724843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912466194] [2025-01-10 01:11:55,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:55,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:55,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:55,593 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:55,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:11:55,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:55,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:55,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:55,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:11:55,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:55,744 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:11:55,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 01:11:55,808 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:11:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:55,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912466194] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:56,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-01-10 01:11:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476857816] [2025-01-10 01:11:56,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:56,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:11:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:56,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:11:56,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:11:57,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 80 [2025-01-10 01:11:57,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 128 transitions, 1142 flow. Second operand has 26 states, 26 states have (on average 41.42307692307692) internal successors, (1077), 26 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:57,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:57,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 80 [2025-01-10 01:11:57,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:58,108 INFO L124 PetriNetUnfolderBase]: 1002/1775 cut-off events. [2025-01-10 01:11:58,108 INFO L125 PetriNetUnfolderBase]: For 7954/8620 co-relation queries the response was YES. [2025-01-10 01:11:58,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7792 conditions, 1775 events. 1002/1775 cut-off events. For 7954/8620 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9197 event pairs, 324 based on Foata normal form. 74/1711 useless extension candidates. Maximal degree in co-relation 7446. Up to 387 conditions per place. [2025-01-10 01:11:58,115 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 126 selfloop transitions, 45 changer transitions 0/193 dead transitions. [2025-01-10 01:11:58,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 193 transitions, 1962 flow [2025-01-10 01:11:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:11:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:11:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 665 transitions. [2025-01-10 01:11:58,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-01-10 01:11:58,117 INFO L175 Difference]: Start difference. First operand has 137 places, 128 transitions, 1142 flow. Second operand 14 states and 665 transitions. [2025-01-10 01:11:58,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 193 transitions, 1962 flow [2025-01-10 01:11:58,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 193 transitions, 1920 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-01-10 01:11:58,124 INFO L231 Difference]: Finished difference. Result has 139 places, 127 transitions, 1188 flow [2025-01-10 01:11:58,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1188, PETRI_PLACES=139, PETRI_TRANSITIONS=127} [2025-01-10 01:11:58,125 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 60 predicate places. [2025-01-10 01:11:58,125 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 127 transitions, 1188 flow [2025-01-10 01:11:58,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 41.42307692307692) internal successors, (1077), 26 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:58,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:58,126 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] [2025-01-10 01:11:58,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:11:58,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:11:58,326 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:58,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1149151284, now seen corresponding path program 1 times [2025-01-10 01:11:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461744966] [2025-01-10 01:11:58,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:58,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:58,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:58,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461744966] [2025-01-10 01:11:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461744966] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185310416] [2025-01-10 01:11:58,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:58,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:58,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:58,445 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:58,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:11:58,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:58,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:58,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:58,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:58,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:11:58,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:58,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:58,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185310416] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:58,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:58,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-10 01:11:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865558773] [2025-01-10 01:11:58,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:11:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:58,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:11:58,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:11:58,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:11:58,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 127 transitions, 1188 flow. Second operand has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:58,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:58,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:11:58,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:59,120 INFO L124 PetriNetUnfolderBase]: 1025/1811 cut-off events. [2025-01-10 01:11:59,120 INFO L125 PetriNetUnfolderBase]: For 7686/8204 co-relation queries the response was YES. [2025-01-10 01:11:59,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7662 conditions, 1811 events. 1025/1811 cut-off events. For 7686/8204 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9013 event pairs, 468 based on Foata normal form. 35/1764 useless extension candidates. Maximal degree in co-relation 7306. Up to 839 conditions per place. [2025-01-10 01:11:59,127 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 81 selfloop transitions, 61 changer transitions 0/165 dead transitions. [2025-01-10 01:11:59,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 165 transitions, 1682 flow [2025-01-10 01:11:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:11:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:11:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 543 transitions. [2025-01-10 01:11:59,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.67875 [2025-01-10 01:11:59,129 INFO L175 Difference]: Start difference. First operand has 139 places, 127 transitions, 1188 flow. Second operand 10 states and 543 transitions. [2025-01-10 01:11:59,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 165 transitions, 1682 flow [2025-01-10 01:11:59,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 165 transitions, 1580 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-01-10 01:11:59,136 INFO L231 Difference]: Finished difference. Result has 138 places, 131 transitions, 1273 flow [2025-01-10 01:11:59,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1273, PETRI_PLACES=138, PETRI_TRANSITIONS=131} [2025-01-10 01:11:59,136 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 59 predicate places. [2025-01-10 01:11:59,136 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 131 transitions, 1273 flow [2025-01-10 01:11:59,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:59,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:59,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:59,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:59,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:59,338 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:11:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 746690743, now seen corresponding path program 2 times [2025-01-10 01:11:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412948979] [2025-01-10 01:11:59,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:59,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:11:59,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:11:59,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:59,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:11:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412948979] [2025-01-10 01:11:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412948979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398030654] [2025-01-10 01:11:59,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:59,764 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:59,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:11:59,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:11:59,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:11:59,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:59,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:59,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-10 01:11:59,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:59,877 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:11:59,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:11:59,984 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:11:59,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:11:59,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:12:00,086 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:12:00,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:12:00,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:12:00,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:12:00,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 01:12:00,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:12:00,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:12:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:12:00,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:12:01,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398030654] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:01,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:01,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 24 [2025-01-10 01:12:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25575614] [2025-01-10 01:12:01,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:01,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:12:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:01,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:12:01,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:12:04,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-01-10 01:12:04,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 131 transitions, 1273 flow. Second operand has 26 states, 26 states have (on average 31.615384615384617) internal successors, (822), 26 states have internal predecessors, (822), 0 states have call successors, (0), 0 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:12:04,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:04,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-01-10 01:12:04,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:06,700 INFO L124 PetriNetUnfolderBase]: 2688/4381 cut-off events. [2025-01-10 01:12:06,700 INFO L125 PetriNetUnfolderBase]: For 15822/16515 co-relation queries the response was YES. [2025-01-10 01:12:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17271 conditions, 4381 events. 2688/4381 cut-off events. For 15822/16515 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 23695 event pairs, 415 based on Foata normal form. 124/4465 useless extension candidates. Maximal degree in co-relation 16891. Up to 654 conditions per place. [2025-01-10 01:12:06,722 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 190 selfloop transitions, 49 changer transitions 0/256 dead transitions. [2025-01-10 01:12:06,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 256 transitions, 2385 flow [2025-01-10 01:12:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:12:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:12:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 740 transitions. [2025-01-10 01:12:06,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-01-10 01:12:06,723 INFO L175 Difference]: Start difference. First operand has 138 places, 131 transitions, 1273 flow. Second operand 19 states and 740 transitions. [2025-01-10 01:12:06,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 256 transitions, 2385 flow [2025-01-10 01:12:06,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 256 transitions, 2264 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-10 01:12:06,735 INFO L231 Difference]: Finished difference. Result has 151 places, 134 transitions, 1287 flow [2025-01-10 01:12:06,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1287, PETRI_PLACES=151, PETRI_TRANSITIONS=134} [2025-01-10 01:12:06,735 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 72 predicate places. [2025-01-10 01:12:06,735 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 134 transitions, 1287 flow [2025-01-10 01:12:06,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 31.615384615384617) internal successors, (822), 26 states have internal predecessors, (822), 0 states have call successors, (0), 0 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:12:06,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:06,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:06,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:06,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:06,936 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:12:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash 895974490, now seen corresponding path program 1 times [2025-01-10 01:12:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:06,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220258234] [2025-01-10 01:12:06,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:06,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:12:06,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:12:06,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220258234] [2025-01-10 01:12:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220258234] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153374980] [2025-01-10 01:12:07,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:07,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:07,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:07,025 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:07,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:12:07,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:12:07,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:12:07,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:07,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:07,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:12:07,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:12:07,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:12:07,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153374980] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:07,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:12:07,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-10 01:12:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942274033] [2025-01-10 01:12:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:07,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:12:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:07,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:12:07,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:12:07,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-01-10 01:12:07,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 134 transitions, 1287 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:12:07,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:07,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-01-10 01:12:07,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:07,452 INFO L124 PetriNetUnfolderBase]: 1151/2314 cut-off events. [2025-01-10 01:12:07,452 INFO L125 PetriNetUnfolderBase]: For 11434/11818 co-relation queries the response was YES. [2025-01-10 01:12:07,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9685 conditions, 2314 events. 1151/2314 cut-off events. For 11434/11818 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 13483 event pairs, 392 based on Foata normal form. 68/2279 useless extension candidates. Maximal degree in co-relation 9324. Up to 991 conditions per place. [2025-01-10 01:12:07,466 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 121 selfloop transitions, 10 changer transitions 0/153 dead transitions. [2025-01-10 01:12:07,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 153 transitions, 1656 flow [2025-01-10 01:12:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2025-01-10 01:12:07,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.67 [2025-01-10 01:12:07,468 INFO L175 Difference]: Start difference. First operand has 151 places, 134 transitions, 1287 flow. Second operand 5 states and 268 transitions. [2025-01-10 01:12:07,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 153 transitions, 1656 flow [2025-01-10 01:12:07,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 153 transitions, 1561 flow, removed 6 selfloop flow, removed 15 redundant places. [2025-01-10 01:12:07,484 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 1200 flow [2025-01-10 01:12:07,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1200, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2025-01-10 01:12:07,484 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 62 predicate places. [2025-01-10 01:12:07,485 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 1200 flow [2025-01-10 01:12:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:12:07,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:07,485 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:07,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 01:12:07,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 01:12:07,685 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:12:07,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1672577222, now seen corresponding path program 1 times [2025-01-10 01:12:07,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:07,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277598704] [2025-01-10 01:12:07,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:07,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:07,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:12:07,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:12:07,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:07,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:12:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277598704] [2025-01-10 01:12:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277598704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227438383] [2025-01-10 01:12:08,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:08,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:08,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:08,084 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:08,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:12:08,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:12:08,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:12:08,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:08,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:08,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-10 01:12:08,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:08,211 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:12:08,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:12:08,261 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:12:08,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 01:12:08,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:12:08,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:12:08,415 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2025-01-10 01:12:08,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2025-01-10 01:12:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:12:08,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:09,018 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:12:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:12:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227438383] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:09,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:09,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2025-01-10 01:12:09,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572469889] [2025-01-10 01:12:09,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 01:12:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:09,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 01:12:09,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:12:11,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-01-10 01:12:11,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 1200 flow. Second operand has 25 states, 25 states have (on average 37.36) internal successors, (934), 25 states have internal predecessors, (934), 0 states have call successors, (0), 0 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:12:11,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:11,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-01-10 01:12:11,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:12,791 INFO L124 PetriNetUnfolderBase]: 1237/2258 cut-off events. [2025-01-10 01:12:12,791 INFO L125 PetriNetUnfolderBase]: For 11293/11804 co-relation queries the response was YES. [2025-01-10 01:12:12,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9619 conditions, 2258 events. 1237/2258 cut-off events. For 11293/11804 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12252 event pairs, 449 based on Foata normal form. 34/2192 useless extension candidates. Maximal degree in co-relation 9272. Up to 567 conditions per place. [2025-01-10 01:12:12,802 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 134 selfloop transitions, 40 changer transitions 0/197 dead transitions. [2025-01-10 01:12:12,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 197 transitions, 1873 flow [2025-01-10 01:12:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:12:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 01:12:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 828 transitions. [2025-01-10 01:12:12,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5175 [2025-01-10 01:12:12,804 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 1200 flow. Second operand 20 states and 828 transitions. [2025-01-10 01:12:12,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 197 transitions, 1873 flow [2025-01-10 01:12:12,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 197 transitions, 1856 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 01:12:12,814 INFO L231 Difference]: Finished difference. Result has 160 places, 135 transitions, 1294 flow [2025-01-10 01:12:12,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1294, PETRI_PLACES=160, PETRI_TRANSITIONS=135} [2025-01-10 01:12:12,815 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 81 predicate places. [2025-01-10 01:12:12,815 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 135 transitions, 1294 flow [2025-01-10 01:12:12,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 37.36) internal successors, (934), 25 states have internal predecessors, (934), 0 states have call successors, (0), 0 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:12:12,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:12,816 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:12,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 01:12:13,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:13,016 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:12:13,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash 310287001, now seen corresponding path program 1 times [2025-01-10 01:12:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:13,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80204498] [2025-01-10 01:12:13,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:13,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:12:13,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:12:13,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:13,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:12:13,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:13,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80204498] [2025-01-10 01:12:13,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80204498] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254555868] [2025-01-10 01:12:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:13,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:13,283 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:13,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 01:12:13,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:12:13,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:12:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:13,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 01:12:13,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:13,436 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:12:13,528 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-10 01:12:13,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-01-10 01:12:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:12:13,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:12:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254555868] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:14,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-01-10 01:12:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176609848] [2025-01-10 01:12:14,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:14,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:12:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:14,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:12:14,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:12:16,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-01-10 01:12:16,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 135 transitions, 1294 flow. Second operand has 24 states, 24 states have (on average 37.583333333333336) internal successors, (902), 24 states have internal predecessors, (902), 0 states have call successors, (0), 0 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:12:16,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:16,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-01-10 01:12:16,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:17,125 INFO L124 PetriNetUnfolderBase]: 1203/2166 cut-off events. [2025-01-10 01:12:17,125 INFO L125 PetriNetUnfolderBase]: For 12692/13279 co-relation queries the response was YES. [2025-01-10 01:12:17,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9697 conditions, 2166 events. 1203/2166 cut-off events. For 12692/13279 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10986 event pairs, 592 based on Foata normal form. 68/2112 useless extension candidates. Maximal degree in co-relation 9334. Up to 653 conditions per place. [2025-01-10 01:12:17,134 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 108 selfloop transitions, 40 changer transitions 0/171 dead transitions. [2025-01-10 01:12:17,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 171 transitions, 1752 flow [2025-01-10 01:12:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:12:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:12:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 600 transitions. [2025-01-10 01:12:17,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-10 01:12:17,135 INFO L175 Difference]: Start difference. First operand has 160 places, 135 transitions, 1294 flow. Second operand 14 states and 600 transitions. [2025-01-10 01:12:17,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 171 transitions, 1752 flow [2025-01-10 01:12:17,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 171 transitions, 1697 flow, removed 1 selfloop flow, removed 12 redundant places. [2025-01-10 01:12:17,146 INFO L231 Difference]: Finished difference. Result has 162 places, 134 transitions, 1311 flow [2025-01-10 01:12:17,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1311, PETRI_PLACES=162, PETRI_TRANSITIONS=134} [2025-01-10 01:12:17,147 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 83 predicate places. [2025-01-10 01:12:17,147 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 134 transitions, 1311 flow [2025-01-10 01:12:17,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 37.583333333333336) internal successors, (902), 24 states have internal predecessors, (902), 0 states have call successors, (0), 0 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:12:17,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:17,147 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:17,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:17,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:17,348 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:12:17,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 680477881, now seen corresponding path program 2 times [2025-01-10 01:12:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266398837] [2025-01-10 01:12:17,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:17,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:12:17,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:12:17,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:17,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:12:17,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266398837] [2025-01-10 01:12:17,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266398837] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695864418] [2025-01-10 01:12:17,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:17,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:17,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:17,749 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:17,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 01:12:17,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:12:17,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:12:17,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:17,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:17,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:12:17,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:17,866 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:12:17,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:12:17,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:12:17,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:12:17,951 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:12:17,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:12:18,003 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:12:18,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:12:18,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:12:18,052 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:12:18,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2025-01-10 01:12:18,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:12:18,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:12:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:12:18,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:12:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695864418] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:19,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2025-01-10 01:12:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436288623] [2025-01-10 01:12:19,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:19,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:12:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:19,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:12:19,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:12:22,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-01-10 01:12:22,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 134 transitions, 1311 flow. Second operand has 28 states, 28 states have (on average 31.714285714285715) internal successors, (888), 28 states have internal predecessors, (888), 0 states have call successors, (0), 0 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:12:22,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:22,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-01-10 01:12:22,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:24,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 01:12:25,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 01:12:28,224 INFO L124 PetriNetUnfolderBase]: 3270/5435 cut-off events. [2025-01-10 01:12:28,225 INFO L125 PetriNetUnfolderBase]: For 24808/25211 co-relation queries the response was YES. [2025-01-10 01:12:28,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21129 conditions, 5435 events. 3270/5435 cut-off events. For 24808/25211 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 31293 event pairs, 468 based on Foata normal form. 168/5561 useless extension candidates. Maximal degree in co-relation 20752. Up to 852 conditions per place. [2025-01-10 01:12:28,253 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 179 selfloop transitions, 51 changer transitions 0/251 dead transitions. [2025-01-10 01:12:28,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 251 transitions, 2430 flow [2025-01-10 01:12:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:12:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:12:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 701 transitions. [2025-01-10 01:12:28,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48680555555555555 [2025-01-10 01:12:28,254 INFO L175 Difference]: Start difference. First operand has 162 places, 134 transitions, 1311 flow. Second operand 18 states and 701 transitions. [2025-01-10 01:12:28,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 251 transitions, 2430 flow [2025-01-10 01:12:28,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 251 transitions, 2308 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-01-10 01:12:28,269 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 1372 flow [2025-01-10 01:12:28,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1372, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2025-01-10 01:12:28,269 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 88 predicate places. [2025-01-10 01:12:28,270 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 1372 flow [2025-01-10 01:12:28,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 31.714285714285715) internal successors, (888), 28 states have internal predecessors, (888), 0 states have call successors, (0), 0 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:12:28,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:28,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:28,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-10 01:12:28,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-10 01:12:28,471 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:12:28,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash -380021488, now seen corresponding path program 1 times [2025-01-10 01:12:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:28,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838394945] [2025-01-10 01:12:28,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:28,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:12:28,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:12:28,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:28,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:12:28,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:28,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838394945] [2025-01-10 01:12:28,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838394945] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:28,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260218825] [2025-01-10 01:12:28,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:28,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:28,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:28,873 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:28,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 01:12:28,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:12:28,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:12:28,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:28,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:28,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-10 01:12:28,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:28,990 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:12:29,025 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:12:29,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 01:12:29,152 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-10 01:12:29,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2025-01-10 01:12:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:12:29,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:12:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260218825] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:29,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 25 [2025-01-10 01:12:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658683282] [2025-01-10 01:12:29,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:29,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:12:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:29,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:12:29,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:12:31,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-01-10 01:12:31,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 1372 flow. Second operand has 26 states, 26 states have (on average 37.5) internal successors, (975), 26 states have internal predecessors, (975), 0 states have call successors, (0), 0 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:12:31,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:31,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-01-10 01:12:31,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:33,121 INFO L124 PetriNetUnfolderBase]: 1929/3358 cut-off events. [2025-01-10 01:12:33,121 INFO L125 PetriNetUnfolderBase]: For 21279/21912 co-relation queries the response was YES. [2025-01-10 01:12:33,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15119 conditions, 3358 events. 1929/3358 cut-off events. For 21279/21912 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 18793 event pairs, 742 based on Foata normal form. 117/3207 useless extension candidates. Maximal degree in co-relation 14744. Up to 818 conditions per place. [2025-01-10 01:12:33,175 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 128 selfloop transitions, 43 changer transitions 0/199 dead transitions. [2025-01-10 01:12:33,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 199 transitions, 2055 flow [2025-01-10 01:12:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:12:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:12:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 687 transitions. [2025-01-10 01:12:33,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53671875 [2025-01-10 01:12:33,177 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 1372 flow. Second operand 16 states and 687 transitions. [2025-01-10 01:12:33,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 199 transitions, 2055 flow [2025-01-10 01:12:33,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 199 transitions, 1959 flow, removed 7 selfloop flow, removed 13 redundant places. [2025-01-10 01:12:33,193 INFO L231 Difference]: Finished difference. Result has 172 places, 142 transitions, 1394 flow [2025-01-10 01:12:33,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1394, PETRI_PLACES=172, PETRI_TRANSITIONS=142} [2025-01-10 01:12:33,194 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 93 predicate places. [2025-01-10 01:12:33,194 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 142 transitions, 1394 flow [2025-01-10 01:12:33,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 37.5) internal successors, (975), 26 states have internal predecessors, (975), 0 states have call successors, (0), 0 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:12:33,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:33,195 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:33,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-10 01:12:33,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-01-10 01:12:33,395 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-01-10 01:12:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1104236443, now seen corresponding path program 1 times [2025-01-10 01:12:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178873146] [2025-01-10 01:12:33,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:33,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:12:33,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:12:33,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:12:33,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:33,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178873146] [2025-01-10 01:12:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178873146] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:33,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230605151] [2025-01-10 01:12:33,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:33,691 INFO L229 MonitoredProcess]: Starting monitored process 24 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:12:33,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-10 01:12:33,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:12:33,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:12:33,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:33,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:33,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:12:33,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:33,830 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:12:33,912 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:12:33,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:12:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:12:34,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:12:34,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230605151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:34,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:34,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2025-01-10 01:12:34,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809181280] [2025-01-10 01:12:34,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:34,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 01:12:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:34,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 01:12:34,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702