./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.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/unroll-cond-2.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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:14:16,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:14:16,644 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:14:16,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:14:16,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:14:16,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:14:16,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:14:16,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:14:16,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:14:16,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:14:16,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:14:16,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:14:16,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:14:16,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:14:16,712 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:14:16,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:14:16,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:14:16,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:14:16,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:14:16,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:14:16,713 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:14:16,713 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:14:16,713 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:14:16,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:14:16,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:14:16,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:14:16,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:14:16,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:14:16,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:14:16,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:16,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:16,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:14:16,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:14:16,719 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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2025-01-10 01:14:17,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:14:17,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:14:17,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:14:17,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:14:17,034 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:14:17,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-01-10 01:14:18,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb603b02/05ae9d29932f45e188508451a2deed8e/FLAG18752a6d2 [2025-01-10 01:14:18,812 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:14:18,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-01-10 01:14:18,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb603b02/05ae9d29932f45e188508451a2deed8e/FLAG18752a6d2 [2025-01-10 01:14:19,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb603b02/05ae9d29932f45e188508451a2deed8e [2025-01-10 01:14:19,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:14:19,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:14:19,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:19,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:14:19,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:14:19,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62db1ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19, skipping insertion in model container [2025-01-10 01:14:19,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:14:19,423 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:14:19,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:19,451 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:14:19,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:19,511 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:14:19,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19 WrapperNode [2025-01-10 01:14:19,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:19,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:19,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:14:19,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:14:19,523 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:14:19" (1/1) ... [2025-01-10 01:14:19,533 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:14:19" (1/1) ... [2025-01-10 01:14:19,569 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-01-10 01:14:19,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:19,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:14:19,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:14:19,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:14:19,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,617 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:14:19,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:14:19,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:14:19,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:14:19,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:14:19,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (1/1) ... [2025-01-10 01:14:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:19,704 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:14:19,706 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:14:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:14:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:14:19,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:14:19,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:14:19,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:14:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:14:19,724 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:14:19,797 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:14:19,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:14:19,959 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:14:19,959 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:14:20,099 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:14:20,100 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:14:20,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:20 BoogieIcfgContainer [2025-01-10 01:14:20,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:14:20,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:14:20,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:14:20,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:14:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:14:19" (1/3) ... [2025-01-10 01:14:20,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2c208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:20, skipping insertion in model container [2025-01-10 01:14:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:19" (2/3) ... [2025-01-10 01:14:20,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2c208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:20, skipping insertion in model container [2025-01-10 01:14:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:20" (3/3) ... [2025-01-10 01:14:20,106 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-01-10 01:14:20,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:14:20,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 37 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-01-10 01:14:20,116 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:14:20,176 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:14:20,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 94 flow [2025-01-10 01:14:20,225 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-01-10 01:14:20,227 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:14:20,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-01-10 01:14:20,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 40 transitions, 94 flow [2025-01-10 01:14:20,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 86 flow [2025-01-10 01:14:20,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:14:20,243 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;@10ad392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:14:20,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 01:14:20,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:14:20,246 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:14:20,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:14:20,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:20,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:20,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:20,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash 447381, now seen corresponding path program 1 times [2025-01-10 01:14:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38971270] [2025-01-10 01:14:20,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:20,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:20,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:20,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:20,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:20,449 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:14:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:20,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38971270] [2025-01-10 01:14:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38971270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:14:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975981129] [2025-01-10 01:14:20,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:20,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:20,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:20,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:20,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:20,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:20,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:20,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:20,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:20,622 INFO L124 PetriNetUnfolderBase]: 97/235 cut-off events. [2025-01-10 01:14:20,622 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 01:14:20,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 235 events. 97/235 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1072 event pairs, 64 based on Foata normal form. 1/194 useless extension candidates. Maximal degree in co-relation 364. Up to 163 conditions per place. [2025-01-10 01:14:20,627 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 20 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-01-10 01:14:20,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 124 flow [2025-01-10 01:14:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-01-10 01:14:20,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-01-10 01:14:20,644 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 3 states and 69 transitions. [2025-01-10 01:14:20,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 124 flow [2025-01-10 01:14:20,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:20,651 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 76 flow [2025-01-10 01:14:20,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2025-01-10 01:14:20,655 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-01-10 01:14:20,657 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 76 flow [2025-01-10 01:14:20,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:20,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:20,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:14:20,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 447382, now seen corresponding path program 1 times [2025-01-10 01:14:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745149936] [2025-01-10 01:14:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:20,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:20,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:20,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:20,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:20,930 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:14:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745149936] [2025-01-10 01:14:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745149936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:20,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:20,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658760102] [2025-01-10 01:14:20,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:20,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:20,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:20,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:20,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:20,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:20,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:20,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:20,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:21,066 INFO L124 PetriNetUnfolderBase]: 98/238 cut-off events. [2025-01-10 01:14:21,067 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:14:21,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 238 events. 98/238 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1084 event pairs, 64 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 396. Up to 168 conditions per place. [2025-01-10 01:14:21,068 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 23 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-01-10 01:14:21,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 136 flow [2025-01-10 01:14:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-01-10 01:14:21,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 01:14:21,069 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 76 flow. Second operand 3 states and 72 transitions. [2025-01-10 01:14:21,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 136 flow [2025-01-10 01:14:21,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:21,071 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 91 flow [2025-01-10 01:14:21,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2025-01-10 01:14:21,072 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-01-10 01:14:21,072 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 91 flow [2025-01-10 01:14:21,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:21,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:21,072 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:14:21,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:14:21,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:21,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash 429948073, now seen corresponding path program 1 times [2025-01-10 01:14:21,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:21,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806105812] [2025-01-10 01:14:21,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:21,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:21,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:21,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:21,333 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:14:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806105812] [2025-01-10 01:14:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806105812] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265591708] [2025-01-10 01:14:21,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:21,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:21,336 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:14:21,340 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:14:21,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:21,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:21,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:21,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:21,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:21,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:21,430 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:14:21,528 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:14:21,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:21,611 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:14:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265591708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:21,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697630536] [2025-01-10 01:14:21,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:21,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:21,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:21,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:21,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:21,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 91 flow. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:21,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:21,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:21,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:21,903 INFO L124 PetriNetUnfolderBase]: 98/237 cut-off events. [2025-01-10 01:14:21,903 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:14:21,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 237 events. 98/237 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1079 event pairs, 64 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 396. Up to 164 conditions per place. [2025-01-10 01:14:21,905 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 19 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2025-01-10 01:14:21,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 139 flow [2025-01-10 01:14:21,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-01-10 01:14:21,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.505 [2025-01-10 01:14:21,906 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 91 flow. Second operand 5 states and 101 transitions. [2025-01-10 01:14:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 139 flow [2025-01-10 01:14:21,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:21,907 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 104 flow [2025-01-10 01:14:21,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-01-10 01:14:21,908 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2025-01-10 01:14:21,908 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 104 flow [2025-01-10 01:14:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:21,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:21,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:14:21,917 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:14:22,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:22,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:22,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash 445917247, now seen corresponding path program 1 times [2025-01-10 01:14:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:22,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141170006] [2025-01-10 01:14:22,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:22,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:14:22,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:14:22,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:22,156 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:14:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141170006] [2025-01-10 01:14:22,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141170006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:22,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:22,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710073107] [2025-01-10 01:14:22,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:22,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:22,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:22,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:22,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2025-01-10 01:14:22,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:22,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:22,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2025-01-10 01:14:22,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:22,216 INFO L124 PetriNetUnfolderBase]: 98/211 cut-off events. [2025-01-10 01:14:22,216 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:14:22,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 211 events. 98/211 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 811 event pairs, 64 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 378. Up to 163 conditions per place. [2025-01-10 01:14:22,217 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 22 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-01-10 01:14:22,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 146 flow [2025-01-10 01:14:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:14:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:14:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-01-10 01:14:22,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-01-10 01:14:22,218 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 104 flow. Second operand 4 states and 70 transitions. [2025-01-10 01:14:22,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 146 flow [2025-01-10 01:14:22,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 133 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:22,219 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 89 flow [2025-01-10 01:14:22,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-01-10 01:14:22,220 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-01-10 01:14:22,220 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 89 flow [2025-01-10 01:14:22,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:22,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:22,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:14:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:14:22,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash 445917248, now seen corresponding path program 1 times [2025-01-10 01:14:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:22,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285787643] [2025-01-10 01:14:22,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:22,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:22,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:14:22,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:14:22,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:22,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:22,253 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:14:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285787643] [2025-01-10 01:14:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285787643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533855044] [2025-01-10 01:14:22,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:22,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:22,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:22,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-01-10 01:14:22,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:22,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:22,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-01-10 01:14:22,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:22,297 INFO L124 PetriNetUnfolderBase]: 97/210 cut-off events. [2025-01-10 01:14:22,298 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:14:22,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 210 events. 97/210 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 805 event pairs, 64 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 370. Up to 166 conditions per place. [2025-01-10 01:14:22,299 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 22 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-01-10 01:14:22,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 132 flow [2025-01-10 01:14:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 01:14:22,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2025-01-10 01:14:22,300 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 89 flow. Second operand 3 states and 73 transitions. [2025-01-10 01:14:22,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 132 flow [2025-01-10 01:14:22,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:22,301 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 85 flow [2025-01-10 01:14:22,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-01-10 01:14:22,302 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-01-10 01:14:22,302 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 85 flow [2025-01-10 01:14:22,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:22,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:22,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:14:22,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash 993428045, now seen corresponding path program 1 times [2025-01-10 01:14:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969708668] [2025-01-10 01:14:22,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:22,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:22,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:22,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:22,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:22,430 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:14:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969708668] [2025-01-10 01:14:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969708668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292259389] [2025-01-10 01:14:22,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:22,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:22,433 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:14:22,440 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:14:22,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:22,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:22,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:22,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:22,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:22,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:22,561 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:14:22,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:22,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:14:22,653 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:14:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292259389] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:22,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:14:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120230738] [2025-01-10 01:14:22,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:14:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:14:22,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:14:22,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:22,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 85 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:22,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:22,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:22,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:22,902 INFO L124 PetriNetUnfolderBase]: 205/390 cut-off events. [2025-01-10 01:14:22,902 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:14:22,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 390 events. 205/390 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1695 event pairs, 71 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 746. Up to 196 conditions per place. [2025-01-10 01:14:22,904 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 37 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-01-10 01:14:22,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 202 flow [2025-01-10 01:14:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-01-10 01:14:22,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.585 [2025-01-10 01:14:22,905 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 85 flow. Second operand 5 states and 117 transitions. [2025-01-10 01:14:22,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 202 flow [2025-01-10 01:14:22,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:22,907 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 97 flow [2025-01-10 01:14:22,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-01-10 01:14:22,907 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-01-10 01:14:22,907 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 97 flow [2025-01-10 01:14:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:22,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:22,908 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:22,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:23,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1201626064, now seen corresponding path program 1 times [2025-01-10 01:14:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108153435] [2025-01-10 01:14:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:23,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:23,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:23,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108153435] [2025-01-10 01:14:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108153435] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449072806] [2025-01-10 01:14:23,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:23,301 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:14:23,303 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:14:23,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:23,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:23,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:23,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:23,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:23,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:23,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:23,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-01-10 01:14:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449072806] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:23,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-01-10 01:14:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675974345] [2025-01-10 01:14:23,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:23,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:14:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:23,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:14:23,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:14:23,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:23,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 97 flow. Second operand has 16 states, 16 states have (on average 16.8125) internal successors, (269), 16 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:23,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:23,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:23,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:24,235 INFO L124 PetriNetUnfolderBase]: 372/750 cut-off events. [2025-01-10 01:14:24,236 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-01-10 01:14:24,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 750 events. 372/750 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3963 event pairs, 209 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 787. Up to 328 conditions per place. [2025-01-10 01:14:24,239 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 64 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2025-01-10 01:14:24,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 79 transitions, 362 flow [2025-01-10 01:14:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2025-01-10 01:14:24,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603125 [2025-01-10 01:14:24,240 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 97 flow. Second operand 8 states and 193 transitions. [2025-01-10 01:14:24,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 79 transitions, 362 flow [2025-01-10 01:14:24,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 79 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:24,242 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 162 flow [2025-01-10 01:14:24,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2025-01-10 01:14:24,243 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-01-10 01:14:24,243 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 162 flow [2025-01-10 01:14:24,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.8125) internal successors, (269), 16 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:24,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:24,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:24,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:24,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1178271075, now seen corresponding path program 1 times [2025-01-10 01:14:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:24,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456480350] [2025-01-10 01:14:24,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:24,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:24,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:24,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:24,610 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:14:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456480350] [2025-01-10 01:14:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456480350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773083852] [2025-01-10 01:14:24,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:24,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:24,612 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:14:24,614 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:14:24,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:24,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:24,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:24,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:24,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:24,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:24,706 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:14:24,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:24,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:14:24,768 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:14:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773083852] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:24,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:14:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379000779] [2025-01-10 01:14:24,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:24,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:14:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:24,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:14:24,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:14:24,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-10 01:14:24,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:24,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:24,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-10 01:14:24,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:25,025 INFO L124 PetriNetUnfolderBase]: 739/1331 cut-off events. [2025-01-10 01:14:25,026 INFO L125 PetriNetUnfolderBase]: For 677/719 co-relation queries the response was YES. [2025-01-10 01:14:25,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1331 events. 739/1331 cut-off events. For 677/719 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6848 event pairs, 204 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 2532. Up to 775 conditions per place. [2025-01-10 01:14:25,031 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 45 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2025-01-10 01:14:25,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 326 flow [2025-01-10 01:14:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-01-10 01:14:25,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-01-10 01:14:25,032 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 162 flow. Second operand 5 states and 107 transitions. [2025-01-10 01:14:25,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 326 flow [2025-01-10 01:14:25,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 320 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:25,034 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 186 flow [2025-01-10 01:14:25,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-01-10 01:14:25,035 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-01-10 01:14:25,035 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 186 flow [2025-01-10 01:14:25,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:25,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:25,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:25,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:25,239 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:14:25,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:25,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2128301867, now seen corresponding path program 1 times [2025-01-10 01:14:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:25,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824594499] [2025-01-10 01:14:25,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:25,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:25,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:25,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:25,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:25,347 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:14:25,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:25,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824594499] [2025-01-10 01:14:25,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824594499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:25,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764510873] [2025-01-10 01:14:25,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:25,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:25,350 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:14:25,357 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:14:25,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:25,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:25,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:25,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:25,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:25,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:25,490 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:14:25,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:25,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:14:25,699 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:14:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764510873] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:25,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:14:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830973098] [2025-01-10 01:14:25,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:14:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:25,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:14:25,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:14:25,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-10 01:14:25,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 186 flow. Second operand has 13 states, 13 states have (on average 15.461538461538462) internal successors, (201), 13 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:25,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:25,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-10 01:14:25,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:26,018 INFO L124 PetriNetUnfolderBase]: 762/1373 cut-off events. [2025-01-10 01:14:26,018 INFO L125 PetriNetUnfolderBase]: For 693/768 co-relation queries the response was YES. [2025-01-10 01:14:26,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3374 conditions, 1373 events. 762/1373 cut-off events. For 693/768 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7126 event pairs, 393 based on Foata normal form. 0/1269 useless extension candidates. Maximal degree in co-relation 2859. Up to 990 conditions per place. [2025-01-10 01:14:26,050 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 55 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2025-01-10 01:14:26,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 413 flow [2025-01-10 01:14:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-01-10 01:14:26,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-01-10 01:14:26,051 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 186 flow. Second operand 7 states and 146 transitions. [2025-01-10 01:14:26,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 413 flow [2025-01-10 01:14:26,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 403 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:26,053 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 219 flow [2025-01-10 01:14:26,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-01-10 01:14:26,054 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-01-10 01:14:26,054 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 219 flow [2025-01-10 01:14:26,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.461538461538462) internal successors, (201), 13 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:26,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:26,054 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:26,064 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:14:26,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:26,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:26,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:26,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1010558813, now seen corresponding path program 2 times [2025-01-10 01:14:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:26,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296379264] [2025-01-10 01:14:26,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:26,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:26,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:26,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 01:14:26,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:26,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:26,389 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:14:26,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296379264] [2025-01-10 01:14:26,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296379264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257338469] [2025-01-10 01:14:26,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:26,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:26,397 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:14:26,401 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:14:26,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:26,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 01:14:26,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:26,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:14:26,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:26,464 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:14:26,587 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:14:26,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:26,686 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:14:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257338469] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:26,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:26,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-01-10 01:14:26,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496360280] [2025-01-10 01:14:26,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:26,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:14:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:26,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:14:26,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:14:26,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:26,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 219 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:26,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:26,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:26,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:27,014 INFO L124 PetriNetUnfolderBase]: 616/1180 cut-off events. [2025-01-10 01:14:27,014 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2025-01-10 01:14:27,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 1180 events. 616/1180 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6533 event pairs, 339 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 2547. Up to 751 conditions per place. [2025-01-10 01:14:27,020 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 42 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-01-10 01:14:27,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 374 flow [2025-01-10 01:14:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-01-10 01:14:27,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54 [2025-01-10 01:14:27,022 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 219 flow. Second operand 5 states and 108 transitions. [2025-01-10 01:14:27,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 374 flow [2025-01-10 01:14:27,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 359 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:27,025 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 218 flow [2025-01-10 01:14:27,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-01-10 01:14:27,026 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-01-10 01:14:27,027 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 218 flow [2025-01-10 01:14:27,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:27,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:27,027 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:27,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:27,228 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,SelfDestructingSolverStorable9 [2025-01-10 01:14:27,228 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:27,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash -893646566, now seen corresponding path program 1 times [2025-01-10 01:14:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922302808] [2025-01-10 01:14:27,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:27,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:27,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:27,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:27,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:27,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922302808] [2025-01-10 01:14:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922302808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141564029] [2025-01-10 01:14:27,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:27,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:27,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:27,361 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:14:27,363 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:14:27,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:27,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:27,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:27,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:27,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:27,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:27,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:27,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-01-10 01:14:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:27,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141564029] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:27,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:27,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-01-10 01:14:27,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021446143] [2025-01-10 01:14:27,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:27,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:14:27,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:27,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:14:27,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:14:27,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-10 01:14:27,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 218 flow. Second operand has 16 states, 16 states have (on average 15.375) internal successors, (246), 16 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:27,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:27,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-10 01:14:27,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:28,107 INFO L124 PetriNetUnfolderBase]: 693/1253 cut-off events. [2025-01-10 01:14:28,108 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2025-01-10 01:14:28,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1253 events. 693/1253 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6271 event pairs, 393 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 2833. Up to 603 conditions per place. [2025-01-10 01:14:28,115 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 64 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2025-01-10 01:14:28,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 513 flow [2025-01-10 01:14:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2025-01-10 01:14:28,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54375 [2025-01-10 01:14:28,117 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 218 flow. Second operand 8 states and 174 transitions. [2025-01-10 01:14:28,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 513 flow [2025-01-10 01:14:28,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 477 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:28,121 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 264 flow [2025-01-10 01:14:28,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=264, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2025-01-10 01:14:28,122 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-01-10 01:14:28,122 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 264 flow [2025-01-10 01:14:28,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.375) internal successors, (246), 16 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:28,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:28,123 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:28,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:28,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:28,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 538547944, now seen corresponding path program 2 times [2025-01-10 01:14:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:28,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690513569] [2025-01-10 01:14:28,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:28,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 01:14:28,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-01-10 01:14:28,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:28,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690513569] [2025-01-10 01:14:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690513569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:28,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:28,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:14:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998879409] [2025-01-10 01:14:28,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:28,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:28,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:28,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:28,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-10 01:14:28,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:28,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:28,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-10 01:14:28,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:28,670 INFO L124 PetriNetUnfolderBase]: 668/1198 cut-off events. [2025-01-10 01:14:28,671 INFO L125 PetriNetUnfolderBase]: For 1056/1056 co-relation queries the response was YES. [2025-01-10 01:14:28,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3370 conditions, 1198 events. 668/1198 cut-off events. For 1056/1056 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5942 event pairs, 456 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 2904. Up to 950 conditions per place. [2025-01-10 01:14:28,675 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 43 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2025-01-10 01:14:28,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 407 flow [2025-01-10 01:14:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-01-10 01:14:28,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-01-10 01:14:28,676 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 264 flow. Second operand 5 states and 96 transitions. [2025-01-10 01:14:28,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 407 flow [2025-01-10 01:14:28,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 391 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:28,679 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 260 flow [2025-01-10 01:14:28,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-01-10 01:14:28,682 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-01-10 01:14:28,683 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 260 flow [2025-01-10 01:14:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:28,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:28,683 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:14:28,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2146453907, now seen corresponding path program 2 times [2025-01-10 01:14:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345960288] [2025-01-10 01:14:28,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:28,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:14:28,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 15 statements. [2025-01-10 01:14:28,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:28,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:28,795 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:14:28,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345960288] [2025-01-10 01:14:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345960288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12834050] [2025-01-10 01:14:28,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:28,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:28,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:28,798 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:14:28,803 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:14:28,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:14:28,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 15 statements. [2025-01-10 01:14:28,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:28,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:28,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:14:28,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:28,858 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:14:28,982 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:14:28,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:29,090 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:14:29,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12834050] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:29,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:29,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-01-10 01:14:29,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106350390] [2025-01-10 01:14:29,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:29,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:14:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:29,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:14:29,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:14:29,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-10 01:14:29,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 260 flow. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:29,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:29,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-10 01:14:29,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:29,451 INFO L124 PetriNetUnfolderBase]: 614/1104 cut-off events. [2025-01-10 01:14:29,452 INFO L125 PetriNetUnfolderBase]: For 965/965 co-relation queries the response was YES. [2025-01-10 01:14:29,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 1104 events. 614/1104 cut-off events. For 965/965 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5491 event pairs, 246 based on Foata normal form. 16/1107 useless extension candidates. Maximal degree in co-relation 2745. Up to 560 conditions per place. [2025-01-10 01:14:29,458 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 36 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2025-01-10 01:14:29,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 393 flow [2025-01-10 01:14:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-01-10 01:14:29,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-01-10 01:14:29,459 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 260 flow. Second operand 5 states and 95 transitions. [2025-01-10 01:14:29,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 393 flow [2025-01-10 01:14:29,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 375 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:29,465 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 258 flow [2025-01-10 01:14:29,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-01-10 01:14:29,466 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-01-10 01:14:29,466 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 258 flow [2025-01-10 01:14:29,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:29,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:29,467 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:14:29,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:14:29,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:29,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:29,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 97670313, now seen corresponding path program 1 times [2025-01-10 01:14:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:29,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254574249] [2025-01-10 01:14:29,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:29,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:14:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:14:29,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:29,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:29,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:29,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254574249] [2025-01-10 01:14:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254574249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:29,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:29,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178590306] [2025-01-10 01:14:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:29,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:29,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:29,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:29,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-01-10 01:14:29,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:29,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:29,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-01-10 01:14:29,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:29,839 INFO L124 PetriNetUnfolderBase]: 624/1112 cut-off events. [2025-01-10 01:14:29,840 INFO L125 PetriNetUnfolderBase]: For 1206/1206 co-relation queries the response was YES. [2025-01-10 01:14:29,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 1112 events. 624/1112 cut-off events. For 1206/1206 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5445 event pairs, 171 based on Foata normal form. 2/1106 useless extension candidates. Maximal degree in co-relation 2871. Up to 788 conditions per place. [2025-01-10 01:14:29,845 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 50 selfloop transitions, 7 changer transitions 1/61 dead transitions. [2025-01-10 01:14:29,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 459 flow [2025-01-10 01:14:29,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-01-10 01:14:29,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-01-10 01:14:29,845 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 258 flow. Second operand 3 states and 86 transitions. [2025-01-10 01:14:29,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 459 flow [2025-01-10 01:14:29,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 423 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:29,849 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 309 flow [2025-01-10 01:14:29,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-01-10 01:14:29,850 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-01-10 01:14:29,850 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 309 flow [2025-01-10 01:14:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:29,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:29,850 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:14:29,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:14:29,850 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:29,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash -72476723, now seen corresponding path program 1 times [2025-01-10 01:14:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:29,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025439607] [2025-01-10 01:14:29,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:29,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:29,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:14:29,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:14:29,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:29,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025439607] [2025-01-10 01:14:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025439607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:29,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:29,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663653673] [2025-01-10 01:14:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:29,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:29,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:29,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:29,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:29,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:29,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:29,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:29,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:30,084 INFO L124 PetriNetUnfolderBase]: 698/1212 cut-off events. [2025-01-10 01:14:30,085 INFO L125 PetriNetUnfolderBase]: For 1293/1293 co-relation queries the response was YES. [2025-01-10 01:14:30,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3629 conditions, 1212 events. 698/1212 cut-off events. For 1293/1293 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6148 event pairs, 257 based on Foata normal form. 18/1230 useless extension candidates. Maximal degree in co-relation 3114. Up to 664 conditions per place. [2025-01-10 01:14:30,090 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 86 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2025-01-10 01:14:30,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 97 transitions, 762 flow [2025-01-10 01:14:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-10 01:14:30,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655 [2025-01-10 01:14:30,091 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 309 flow. Second operand 5 states and 131 transitions. [2025-01-10 01:14:30,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 97 transitions, 762 flow [2025-01-10 01:14:30,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 745 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:30,095 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 371 flow [2025-01-10 01:14:30,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=371, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-01-10 01:14:30,097 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2025-01-10 01:14:30,097 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 371 flow [2025-01-10 01:14:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:30,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:30,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:30,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:14:30,097 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:30,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1210457761, now seen corresponding path program 2 times [2025-01-10 01:14:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:30,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087714433] [2025-01-10 01:14:30,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:30,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:14:30,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 19 statements. [2025-01-10 01:14:30,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:30,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087714433] [2025-01-10 01:14:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087714433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:30,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:14:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553305529] [2025-01-10 01:14:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:30,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:30,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:30,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:30,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:30,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 371 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:30,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:30,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:30,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:30,386 INFO L124 PetriNetUnfolderBase]: 744/1278 cut-off events. [2025-01-10 01:14:30,386 INFO L125 PetriNetUnfolderBase]: For 2354/2354 co-relation queries the response was YES. [2025-01-10 01:14:30,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 1278 events. 744/1278 cut-off events. For 2354/2354 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6095 event pairs, 173 based on Foata normal form. 60/1338 useless extension candidates. Maximal degree in co-relation 3930. Up to 594 conditions per place. [2025-01-10 01:14:30,393 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 90 selfloop transitions, 29 changer transitions 0/120 dead transitions. [2025-01-10 01:14:30,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 120 transitions, 988 flow [2025-01-10 01:14:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-01-10 01:14:30,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596875 [2025-01-10 01:14:30,394 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 371 flow. Second operand 8 states and 191 transitions. [2025-01-10 01:14:30,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 120 transitions, 988 flow [2025-01-10 01:14:30,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 954 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:30,400 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 630 flow [2025-01-10 01:14:30,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=630, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2025-01-10 01:14:30,401 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2025-01-10 01:14:30,401 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 630 flow [2025-01-10 01:14:30,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:30,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:30,402 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:14:30,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:14:30,402 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:30,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 215948435, now seen corresponding path program 3 times [2025-01-10 01:14:30,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041784141] [2025-01-10 01:14:30,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:30,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:14:30,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 19 statements. [2025-01-10 01:14:30,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:30,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:30,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:30,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041784141] [2025-01-10 01:14:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041784141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398704275] [2025-01-10 01:14:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:30,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:30,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:30,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:30,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:30,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 630 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:30,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:30,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:30,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:30,661 INFO L124 PetriNetUnfolderBase]: 836/1428 cut-off events. [2025-01-10 01:14:30,661 INFO L125 PetriNetUnfolderBase]: For 5322/5322 co-relation queries the response was YES. [2025-01-10 01:14:30,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6168 conditions, 1428 events. 836/1428 cut-off events. For 5322/5322 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7145 event pairs, 256 based on Foata normal form. 8/1436 useless extension candidates. Maximal degree in co-relation 5636. Up to 686 conditions per place. [2025-01-10 01:14:30,671 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 92 selfloop transitions, 31 changer transitions 1/125 dead transitions. [2025-01-10 01:14:30,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 125 transitions, 1341 flow [2025-01-10 01:14:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-10 01:14:30,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-01-10 01:14:30,672 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 630 flow. Second operand 5 states and 130 transitions. [2025-01-10 01:14:30,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 125 transitions, 1341 flow [2025-01-10 01:14:30,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1283 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:30,684 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 923 flow [2025-01-10 01:14:30,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=923, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2025-01-10 01:14:30,685 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 39 predicate places. [2025-01-10 01:14:30,685 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 923 flow [2025-01-10 01:14:30,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:30,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:30,685 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:14:30,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:14:30,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:30,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1320583613, now seen corresponding path program 4 times [2025-01-10 01:14:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959018150] [2025-01-10 01:14:30,686 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:30,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:14:30,699 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:14:30,699 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:30,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:30,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:30,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959018150] [2025-01-10 01:14:30,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959018150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:30,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:30,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997833098] [2025-01-10 01:14:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:30,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:30,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:30,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:30,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:30,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 923 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:30,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:30,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:30,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:31,089 INFO L124 PetriNetUnfolderBase]: 849/1475 cut-off events. [2025-01-10 01:14:31,089 INFO L125 PetriNetUnfolderBase]: For 7295/7295 co-relation queries the response was YES. [2025-01-10 01:14:31,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 1475 events. 849/1475 cut-off events. For 7295/7295 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7425 event pairs, 331 based on Foata normal form. 16/1491 useless extension candidates. Maximal degree in co-relation 6304. Up to 905 conditions per place. [2025-01-10 01:14:31,096 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 49 changer transitions 1/128 dead transitions. [2025-01-10 01:14:31,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 128 transitions, 1525 flow [2025-01-10 01:14:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-01-10 01:14:31,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2025-01-10 01:14:31,098 INFO L175 Difference]: Start difference. First operand has 79 places, 87 transitions, 923 flow. Second operand 6 states and 149 transitions. [2025-01-10 01:14:31,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 128 transitions, 1525 flow [2025-01-10 01:14:31,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 1497 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:31,110 INFO L231 Difference]: Finished difference. Result has 87 places, 105 transitions, 1311 flow [2025-01-10 01:14:31,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1311, PETRI_PLACES=87, PETRI_TRANSITIONS=105} [2025-01-10 01:14:31,110 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2025-01-10 01:14:31,110 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 105 transitions, 1311 flow [2025-01-10 01:14:31,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:31,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:31,111 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:14:31,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:14:31,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:31,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1082870057, now seen corresponding path program 5 times [2025-01-10 01:14:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:31,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663199425] [2025-01-10 01:14:31,111 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:14:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:31,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:14:31,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:14:31,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:31,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663199425] [2025-01-10 01:14:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663199425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:31,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:31,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92566099] [2025-01-10 01:14:31,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:31,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:31,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:31,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:31,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 105 transitions, 1311 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:31,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:31,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:31,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:31,582 INFO L124 PetriNetUnfolderBase]: 850/1452 cut-off events. [2025-01-10 01:14:31,582 INFO L125 PetriNetUnfolderBase]: For 9169/9169 co-relation queries the response was YES. [2025-01-10 01:14:31,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7383 conditions, 1452 events. 850/1452 cut-off events. For 9169/9169 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7324 event pairs, 228 based on Foata normal form. 12/1464 useless extension candidates. Maximal degree in co-relation 6829. Up to 706 conditions per place. [2025-01-10 01:14:31,590 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 107 selfloop transitions, 45 changer transitions 1/154 dead transitions. [2025-01-10 01:14:31,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 154 transitions, 1913 flow [2025-01-10 01:14:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-01-10 01:14:31,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-01-10 01:14:31,593 INFO L175 Difference]: Start difference. First operand has 87 places, 105 transitions, 1311 flow. Second operand 6 states and 156 transitions. [2025-01-10 01:14:31,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 154 transitions, 1913 flow [2025-01-10 01:14:31,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 154 transitions, 1840 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:31,614 INFO L231 Difference]: Finished difference. Result has 93 places, 109 transitions, 1427 flow [2025-01-10 01:14:31,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1427, PETRI_PLACES=93, PETRI_TRANSITIONS=109} [2025-01-10 01:14:31,615 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2025-01-10 01:14:31,615 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 109 transitions, 1427 flow [2025-01-10 01:14:31,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:31,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:31,615 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:14:31,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:14:31,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:31,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash 75826778, now seen corresponding path program 1 times [2025-01-10 01:14:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624629981] [2025-01-10 01:14:31,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:31,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:14:31,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:14:31,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:31,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624629981] [2025-01-10 01:14:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624629981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640360577] [2025-01-10 01:14:31,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:31,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:31,768 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:14:31,770 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:14:31,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:14:31,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:14:31,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:31,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:14:31,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:31,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:14:31,947 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:14:31,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:32,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-01-10 01:14:32,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:14:32,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-01-10 01:14:33,203 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:14:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640360577] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:33,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-01-10 01:14:33,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176289666] [2025-01-10 01:14:33,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:33,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:14:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:33,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:14:33,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:14:33,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-10 01:14:33,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 109 transitions, 1427 flow. Second operand has 18 states, 18 states have (on average 18.22222222222222) internal successors, (328), 18 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:33,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:33,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-10 01:14:33,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:35,057 INFO L124 PetriNetUnfolderBase]: 2699/4683 cut-off events. [2025-01-10 01:14:35,060 INFO L125 PetriNetUnfolderBase]: For 22204/22204 co-relation queries the response was YES. [2025-01-10 01:14:35,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20410 conditions, 4683 events. 2699/4683 cut-off events. For 22204/22204 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 27443 event pairs, 58 based on Foata normal form. 24/4707 useless extension candidates. Maximal degree in co-relation 18264. Up to 783 conditions per place. [2025-01-10 01:14:35,083 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 282 selfloop transitions, 148 changer transitions 142/574 dead transitions. [2025-01-10 01:14:35,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 574 transitions, 5882 flow [2025-01-10 01:14:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:14:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-01-10 01:14:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 1157 transitions. [2025-01-10 01:14:35,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6026041666666667 [2025-01-10 01:14:35,088 INFO L175 Difference]: Start difference. First operand has 93 places, 109 transitions, 1427 flow. Second operand 48 states and 1157 transitions. [2025-01-10 01:14:35,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 574 transitions, 5882 flow [2025-01-10 01:14:35,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 574 transitions, 5750 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:35,125 INFO L231 Difference]: Finished difference. Result has 154 places, 202 transitions, 2473 flow [2025-01-10 01:14:35,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=2473, PETRI_PLACES=154, PETRI_TRANSITIONS=202} [2025-01-10 01:14:35,126 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2025-01-10 01:14:35,126 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 202 transitions, 2473 flow [2025-01-10 01:14:35,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.22222222222222) internal successors, (328), 18 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:35,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:35,126 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:14:35,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:14:35,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:35,327 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:35,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash 191945810, now seen corresponding path program 1 times [2025-01-10 01:14:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725011679] [2025-01-10 01:14:35,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:35,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:14:35,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:14:35,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:35,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:35,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725011679] [2025-01-10 01:14:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725011679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:35,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:35,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308575238] [2025-01-10 01:14:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:35,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:35,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:35,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:35,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-01-10 01:14:35,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 202 transitions, 2473 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:35,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:35,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-01-10 01:14:35,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:36,007 INFO L124 PetriNetUnfolderBase]: 1942/3530 cut-off events. [2025-01-10 01:14:36,007 INFO L125 PetriNetUnfolderBase]: For 21197/21201 co-relation queries the response was YES. [2025-01-10 01:14:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16730 conditions, 3530 events. 1942/3530 cut-off events. For 21197/21201 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20843 event pairs, 650 based on Foata normal form. 4/3512 useless extension candidates. Maximal degree in co-relation 16548. Up to 2726 conditions per place. [2025-01-10 01:14:36,036 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 174 selfloop transitions, 44 changer transitions 1/231 dead transitions. [2025-01-10 01:14:36,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 231 transitions, 3156 flow [2025-01-10 01:14:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-01-10 01:14:36,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-10 01:14:36,038 INFO L175 Difference]: Start difference. First operand has 154 places, 202 transitions, 2473 flow. Second operand 6 states and 148 transitions. [2025-01-10 01:14:36,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 231 transitions, 3156 flow [2025-01-10 01:14:36,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 231 transitions, 2841 flow, removed 122 selfloop flow, removed 16 redundant places. [2025-01-10 01:14:36,096 INFO L231 Difference]: Finished difference. Result has 134 places, 207 transitions, 2357 flow [2025-01-10 01:14:36,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2357, PETRI_PLACES=134, PETRI_TRANSITIONS=207} [2025-01-10 01:14:36,096 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2025-01-10 01:14:36,096 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 207 transitions, 2357 flow [2025-01-10 01:14:36,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:36,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:36,097 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:36,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:14:36,097 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:36,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 984537595, now seen corresponding path program 2 times [2025-01-10 01:14:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890974206] [2025-01-10 01:14:36,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:36,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:36,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:36,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:36,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890974206] [2025-01-10 01:14:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890974206] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:36,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106242237] [2025-01-10 01:14:36,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:36,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:36,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:36,337 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:14:36,348 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:14:36,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:36,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:36,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:36,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:36,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:14:36,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:36,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:14:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:36,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:36,540 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:14:36,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-01-10 01:14:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106242237] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:36,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:36,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:14:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709277427] [2025-01-10 01:14:36,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:36,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:14:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:36,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:14:36,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:37,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2025-01-10 01:14:37,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 207 transitions, 2357 flow. Second operand has 17 states, 17 states have (on average 15.058823529411764) internal successors, (256), 17 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:37,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:37,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2025-01-10 01:14:37,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:37,736 INFO L124 PetriNetUnfolderBase]: 2222/4028 cut-off events. [2025-01-10 01:14:37,736 INFO L125 PetriNetUnfolderBase]: For 19244/19246 co-relation queries the response was YES. [2025-01-10 01:14:37,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17803 conditions, 4028 events. 2222/4028 cut-off events. For 19244/19246 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 24496 event pairs, 644 based on Foata normal form. 11/4012 useless extension candidates. Maximal degree in co-relation 16855. Up to 1778 conditions per place. [2025-01-10 01:14:37,757 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 169 selfloop transitions, 58 changer transitions 70/309 dead transitions. [2025-01-10 01:14:37,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 309 transitions, 3605 flow [2025-01-10 01:14:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:14:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:14:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 269 transitions. [2025-01-10 01:14:37,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5173076923076924 [2025-01-10 01:14:37,762 INFO L175 Difference]: Start difference. First operand has 134 places, 207 transitions, 2357 flow. Second operand 13 states and 269 transitions. [2025-01-10 01:14:37,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 309 transitions, 3605 flow [2025-01-10 01:14:37,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 309 transitions, 3555 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:37,801 INFO L231 Difference]: Finished difference. Result has 148 places, 190 transitions, 2311 flow [2025-01-10 01:14:37,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2307, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2311, PETRI_PLACES=148, PETRI_TRANSITIONS=190} [2025-01-10 01:14:37,801 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 108 predicate places. [2025-01-10 01:14:37,801 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 2311 flow [2025-01-10 01:14:37,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.058823529411764) internal successors, (256), 17 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:37,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:37,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:37,808 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:14:38,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:38,005 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1958171195, now seen corresponding path program 2 times [2025-01-10 01:14:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990178027] [2025-01-10 01:14:38,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:38,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:38,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-01-10 01:14:38,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:38,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:38,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990178027] [2025-01-10 01:14:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990178027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:38,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:38,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:14:38,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613600235] [2025-01-10 01:14:38,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:38,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:38,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:38,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:38,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:38,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:38,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 2311 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:38,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:38,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:38,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:38,625 INFO L124 PetriNetUnfolderBase]: 1847/3220 cut-off events. [2025-01-10 01:14:38,625 INFO L125 PetriNetUnfolderBase]: For 17772/17772 co-relation queries the response was YES. [2025-01-10 01:14:38,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15588 conditions, 3220 events. 1847/3220 cut-off events. For 17772/17772 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17448 event pairs, 982 based on Foata normal form. 9/3229 useless extension candidates. Maximal degree in co-relation 15412. Up to 2430 conditions per place. [2025-01-10 01:14:38,648 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 184 selfloop transitions, 46 changer transitions 0/231 dead transitions. [2025-01-10 01:14:38,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 231 transitions, 3038 flow [2025-01-10 01:14:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-01-10 01:14:38,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5821428571428572 [2025-01-10 01:14:38,649 INFO L175 Difference]: Start difference. First operand has 148 places, 190 transitions, 2311 flow. Second operand 7 states and 163 transitions. [2025-01-10 01:14:38,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 231 transitions, 3038 flow [2025-01-10 01:14:38,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 231 transitions, 2837 flow, removed 62 selfloop flow, removed 12 redundant places. [2025-01-10 01:14:38,699 INFO L231 Difference]: Finished difference. Result has 143 places, 194 transitions, 2316 flow [2025-01-10 01:14:38,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2316, PETRI_PLACES=143, PETRI_TRANSITIONS=194} [2025-01-10 01:14:38,700 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2025-01-10 01:14:38,700 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 194 transitions, 2316 flow [2025-01-10 01:14:38,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:38,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:38,701 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:38,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:14:38,701 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:38,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1436972493, now seen corresponding path program 3 times [2025-01-10 01:14:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:38,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062079352] [2025-01-10 01:14:38,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:38,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:38,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:38,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:14:38,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062079352] [2025-01-10 01:14:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062079352] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134242963] [2025-01-10 01:14:38,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:38,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:38,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:38,844 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:14:38,846 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:14:38,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:38,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:38,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:14:38,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:38,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 01:14:38,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:38,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:14:39,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:14:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:39,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:39,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-10 01:14:39,260 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:14:39,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-01-10 01:14:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:39,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134242963] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:39,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-10 01:14:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335458590] [2025-01-10 01:14:39,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:39,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:14:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:39,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:14:39,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:14:39,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:39,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 194 transitions, 2316 flow. Second operand has 18 states, 18 states have (on average 17.444444444444443) internal successors, (314), 18 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:39,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:39,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:39,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:41,688 INFO L124 PetriNetUnfolderBase]: 2409/4163 cut-off events. [2025-01-10 01:14:41,689 INFO L125 PetriNetUnfolderBase]: For 21503/21503 co-relation queries the response was YES. [2025-01-10 01:14:41,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18603 conditions, 4163 events. 2409/4163 cut-off events. For 21503/21503 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 23699 event pairs, 304 based on Foata normal form. 29/4192 useless extension candidates. Maximal degree in co-relation 18065. Up to 1194 conditions per place. [2025-01-10 01:14:41,713 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 304 selfloop transitions, 109 changer transitions 149/563 dead transitions. [2025-01-10 01:14:41,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 563 transitions, 5642 flow [2025-01-10 01:14:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:14:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-01-10 01:14:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 1032 transitions. [2025-01-10 01:14:41,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-01-10 01:14:41,716 INFO L175 Difference]: Start difference. First operand has 143 places, 194 transitions, 2316 flow. Second operand 48 states and 1032 transitions. [2025-01-10 01:14:41,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 563 transitions, 5642 flow [2025-01-10 01:14:41,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 563 transitions, 5578 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:41,757 INFO L231 Difference]: Finished difference. Result has 208 places, 221 transitions, 2644 flow [2025-01-10 01:14:41,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=2644, PETRI_PLACES=208, PETRI_TRANSITIONS=221} [2025-01-10 01:14:41,757 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 168 predicate places. [2025-01-10 01:14:41,758 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 221 transitions, 2644 flow [2025-01-10 01:14:41,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.444444444444443) internal successors, (314), 18 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:41,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:41,758 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:41,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:41,962 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,SelfDestructingSolverStorable23 [2025-01-10 01:14:41,962 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:41,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:41,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1809351857, now seen corresponding path program 3 times [2025-01-10 01:14:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:41,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182242863] [2025-01-10 01:14:41,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:41,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:41,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:14:41,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:14:41,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:42,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182242863] [2025-01-10 01:14:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182242863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554850203] [2025-01-10 01:14:42,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:42,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:42,059 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:14:42,063 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:14:42,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:42,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:14:42,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:14:42,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:42,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:14:42,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:42,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:42,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554850203] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:42,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:42,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2025-01-10 01:14:42,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467360111] [2025-01-10 01:14:42,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:42,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:14:42,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:42,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:14:42,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:14:42,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:42,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 221 transitions, 2644 flow. Second operand has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:42,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:42,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:42,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:43,396 INFO L124 PetriNetUnfolderBase]: 2309/4065 cut-off events. [2025-01-10 01:14:43,396 INFO L125 PetriNetUnfolderBase]: For 36252/36252 co-relation queries the response was YES. [2025-01-10 01:14:43,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20678 conditions, 4065 events. 2309/4065 cut-off events. For 36252/36252 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 24007 event pairs, 365 based on Foata normal form. 15/4080 useless extension candidates. Maximal degree in co-relation 20612. Up to 1204 conditions per place. [2025-01-10 01:14:43,431 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 245 selfloop transitions, 199 changer transitions 3/448 dead transitions. [2025-01-10 01:14:43,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 448 transitions, 5447 flow [2025-01-10 01:14:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 01:14:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-10 01:14:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 555 transitions. [2025-01-10 01:14:43,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-01-10 01:14:43,432 INFO L175 Difference]: Start difference. First operand has 208 places, 221 transitions, 2644 flow. Second operand 27 states and 555 transitions. [2025-01-10 01:14:43,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 448 transitions, 5447 flow [2025-01-10 01:14:43,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 448 transitions, 5017 flow, removed 128 selfloop flow, removed 16 redundant places. [2025-01-10 01:14:43,505 INFO L231 Difference]: Finished difference. Result has 190 places, 299 transitions, 3630 flow [2025-01-10 01:14:43,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3630, PETRI_PLACES=190, PETRI_TRANSITIONS=299} [2025-01-10 01:14:43,505 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 150 predicate places. [2025-01-10 01:14:43,506 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 299 transitions, 3630 flow [2025-01-10 01:14:43,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:43,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:43,506 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:43,513 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:14:43,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:43,707 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:43,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 425191687, now seen corresponding path program 4 times [2025-01-10 01:14:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329062340] [2025-01-10 01:14:43,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:43,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:43,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:43,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:43,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:43,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329062340] [2025-01-10 01:14:43,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329062340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:43,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:43,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:14:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498910570] [2025-01-10 01:14:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:43,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:14:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:43,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:14:43,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:14:43,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:43,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 299 transitions, 3630 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:43,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:43,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:43,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:44,482 INFO L124 PetriNetUnfolderBase]: 2315/4081 cut-off events. [2025-01-10 01:14:44,482 INFO L125 PetriNetUnfolderBase]: For 30651/30651 co-relation queries the response was YES. [2025-01-10 01:14:44,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20585 conditions, 4081 events. 2315/4081 cut-off events. For 30651/30651 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 23902 event pairs, 1363 based on Foata normal form. 3/4084 useless extension candidates. Maximal degree in co-relation 20523. Up to 3397 conditions per place. [2025-01-10 01:14:44,538 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 279 selfloop transitions, 57 changer transitions 0/337 dead transitions. [2025-01-10 01:14:44,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 337 transitions, 4579 flow [2025-01-10 01:14:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:14:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:14:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2025-01-10 01:14:44,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-01-10 01:14:44,540 INFO L175 Difference]: Start difference. First operand has 190 places, 299 transitions, 3630 flow. Second operand 9 states and 201 transitions. [2025-01-10 01:14:44,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 337 transitions, 4579 flow [2025-01-10 01:14:44,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 337 transitions, 4327 flow, removed 117 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:44,636 INFO L231 Difference]: Finished difference. Result has 198 places, 306 transitions, 3618 flow [2025-01-10 01:14:44,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3387, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3618, PETRI_PLACES=198, PETRI_TRANSITIONS=306} [2025-01-10 01:14:44,637 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2025-01-10 01:14:44,637 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 306 transitions, 3618 flow [2025-01-10 01:14:44,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:44,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:44,638 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:44,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:14:44,638 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:44,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1841782009, now seen corresponding path program 5 times [2025-01-10 01:14:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99003074] [2025-01-10 01:14:44,638 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:14:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:44,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:44,648 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:44,648 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:14:44,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99003074] [2025-01-10 01:14:44,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99003074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889835237] [2025-01-10 01:14:44,784 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:14:44,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:44,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:44,788 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:14:44,792 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:14:44,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:44,879 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:44,879 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:14:44,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:14:44,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:44,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889835237] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:45,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-10 01:14:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005909179] [2025-01-10 01:14:45,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:45,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:14:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:45,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:14:45,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:14:45,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:45,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 306 transitions, 3618 flow. Second operand has 18 states, 18 states have (on average 16.0) internal successors, (288), 18 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:45,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:45,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:45,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:46,523 INFO L124 PetriNetUnfolderBase]: 2851/5034 cut-off events. [2025-01-10 01:14:46,523 INFO L125 PetriNetUnfolderBase]: For 39588/39588 co-relation queries the response was YES. [2025-01-10 01:14:46,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25627 conditions, 5034 events. 2851/5034 cut-off events. For 39588/39588 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 31473 event pairs, 685 based on Foata normal form. 82/5116 useless extension candidates. Maximal degree in co-relation 25562. Up to 1904 conditions per place. [2025-01-10 01:14:46,562 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 374 selfloop transitions, 256 changer transitions 5/636 dead transitions. [2025-01-10 01:14:46,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 636 transitions, 7912 flow [2025-01-10 01:14:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:14:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 01:14:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 693 transitions. [2025-01-10 01:14:46,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5588709677419355 [2025-01-10 01:14:46,566 INFO L175 Difference]: Start difference. First operand has 198 places, 306 transitions, 3618 flow. Second operand 31 states and 693 transitions. [2025-01-10 01:14:46,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 636 transitions, 7912 flow [2025-01-10 01:14:46,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 636 transitions, 7770 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:46,677 INFO L231 Difference]: Finished difference. Result has 242 places, 423 transitions, 6024 flow [2025-01-10 01:14:46,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3504, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=6024, PETRI_PLACES=242, PETRI_TRANSITIONS=423} [2025-01-10 01:14:46,678 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 202 predicate places. [2025-01-10 01:14:46,678 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 423 transitions, 6024 flow [2025-01-10 01:14:46,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.0) internal successors, (288), 18 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:46,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:46,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:46,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:14:46,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:46,880 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:46,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1708071287, now seen corresponding path program 6 times [2025-01-10 01:14:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:46,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943503474] [2025-01-10 01:14:46,885 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:14:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:46,892 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:46,901 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:46,903 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:14:46,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:47,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943503474] [2025-01-10 01:14:47,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943503474] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:47,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68708894] [2025-01-10 01:14:47,073 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:14:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:47,075 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:14:47,080 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:14:47,119 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:47,175 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:47,175 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:14:47,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:47,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:14:47,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:47,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68708894] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:47,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 01:14:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686393437] [2025-01-10 01:14:47,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:14:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:47,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:14:47,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:47,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:47,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 423 transitions, 6024 flow. Second operand has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:47,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:47,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:47,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:49,970 INFO L124 PetriNetUnfolderBase]: 3646/6417 cut-off events. [2025-01-10 01:14:49,971 INFO L125 PetriNetUnfolderBase]: For 74515/74515 co-relation queries the response was YES. [2025-01-10 01:14:50,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38066 conditions, 6417 events. 3646/6417 cut-off events. For 74515/74515 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 42040 event pairs, 672 based on Foata normal form. 21/6438 useless extension candidates. Maximal degree in co-relation 37984. Up to 2063 conditions per place. [2025-01-10 01:14:50,028 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 315 selfloop transitions, 562 changer transitions 3/881 dead transitions. [2025-01-10 01:14:50,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 881 transitions, 12602 flow [2025-01-10 01:14:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-10 01:14:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-01-10 01:14:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 1020 transitions. [2025-01-10 01:14:50,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2025-01-10 01:14:50,034 INFO L175 Difference]: Start difference. First operand has 242 places, 423 transitions, 6024 flow. Second operand 47 states and 1020 transitions. [2025-01-10 01:14:50,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 881 transitions, 12602 flow [2025-01-10 01:14:50,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 881 transitions, 11817 flow, removed 245 selfloop flow, removed 7 redundant places. [2025-01-10 01:14:50,306 INFO L231 Difference]: Finished difference. Result has 299 places, 704 transitions, 10921 flow [2025-01-10 01:14:50,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5567, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=10921, PETRI_PLACES=299, PETRI_TRANSITIONS=704} [2025-01-10 01:14:50,307 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 259 predicate places. [2025-01-10 01:14:50,307 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 704 transitions, 10921 flow [2025-01-10 01:14:50,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:50,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:50,307 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:50,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:50,507 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,SelfDestructingSolverStorable27 [2025-01-10 01:14:50,508 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 314673299, now seen corresponding path program 7 times [2025-01-10 01:14:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283753640] [2025-01-10 01:14:50,508 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:14:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:50,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:14:50,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:50,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:50,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283753640] [2025-01-10 01:14:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283753640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215456092] [2025-01-10 01:14:50,602 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:14:50,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:50,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:50,604 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:14:50,606 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:14:50,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:14:50,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:50,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:50,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:50,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:14:50,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:50,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:50,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215456092] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:50,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:50,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2025-01-10 01:14:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010724908] [2025-01-10 01:14:50,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:50,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:14:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:50,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:14:50,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:14:50,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:50,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 704 transitions, 10921 flow. Second operand has 14 states, 14 states have (on average 16.142857142857142) internal successors, (226), 14 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:50,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:50,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:50,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:52,695 INFO L124 PetriNetUnfolderBase]: 3688/6502 cut-off events. [2025-01-10 01:14:52,696 INFO L125 PetriNetUnfolderBase]: For 85794/85794 co-relation queries the response was YES. [2025-01-10 01:14:52,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41977 conditions, 6502 events. 3688/6502 cut-off events. For 85794/85794 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 42326 event pairs, 624 based on Foata normal form. 18/6520 useless extension candidates. Maximal degree in co-relation 41879. Up to 2253 conditions per place. [2025-01-10 01:14:52,762 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 460 selfloop transitions, 405 changer transitions 4/870 dead transitions. [2025-01-10 01:14:52,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 870 transitions, 14697 flow [2025-01-10 01:14:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:14:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 01:14:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 486 transitions. [2025-01-10 01:14:52,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.50625 [2025-01-10 01:14:52,764 INFO L175 Difference]: Start difference. First operand has 299 places, 704 transitions, 10921 flow. Second operand 24 states and 486 transitions. [2025-01-10 01:14:52,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 870 transitions, 14697 flow [2025-01-10 01:14:53,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 870 transitions, 13675 flow, removed 428 selfloop flow, removed 10 redundant places. [2025-01-10 01:14:53,291 INFO L231 Difference]: Finished difference. Result has 317 places, 743 transitions, 11712 flow [2025-01-10 01:14:53,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10062, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=11712, PETRI_PLACES=317, PETRI_TRANSITIONS=743} [2025-01-10 01:14:53,293 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 277 predicate places. [2025-01-10 01:14:53,293 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 743 transitions, 11712 flow [2025-01-10 01:14:53,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.142857142857142) internal successors, (226), 14 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:53,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:53,293 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:53,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:53,494 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,SelfDestructingSolverStorable28 [2025-01-10 01:14:53,494 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:53,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:53,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1696527667, now seen corresponding path program 8 times [2025-01-10 01:14:53,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:53,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039242041] [2025-01-10 01:14:53,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:53,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:53,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-01-10 01:14:53,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:53,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039242041] [2025-01-10 01:14:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039242041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:53,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:53,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:14:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126214812] [2025-01-10 01:14:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:53,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:14:53,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:53,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:14:53,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:14:53,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:53,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 743 transitions, 11712 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:53,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:53,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:53,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:55,292 INFO L124 PetriNetUnfolderBase]: 3795/6700 cut-off events. [2025-01-10 01:14:55,292 INFO L125 PetriNetUnfolderBase]: For 80426/80426 co-relation queries the response was YES. [2025-01-10 01:14:55,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43455 conditions, 6700 events. 3795/6700 cut-off events. For 80426/80426 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 44297 event pairs, 1802 based on Foata normal form. 3/6703 useless extension candidates. Maximal degree in co-relation 43356. Up to 5875 conditions per place. [2025-01-10 01:14:55,376 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 716 selfloop transitions, 115 changer transitions 1/833 dead transitions. [2025-01-10 01:14:55,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 833 transitions, 14641 flow [2025-01-10 01:14:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:14:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:14:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2025-01-10 01:14:55,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5525 [2025-01-10 01:14:55,377 INFO L175 Difference]: Start difference. First operand has 317 places, 743 transitions, 11712 flow. Second operand 10 states and 221 transitions. [2025-01-10 01:14:55,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 833 transitions, 14641 flow [2025-01-10 01:14:55,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 833 transitions, 14257 flow, removed 88 selfloop flow, removed 7 redundant places. [2025-01-10 01:14:55,892 INFO L231 Difference]: Finished difference. Result has 325 places, 774 transitions, 12261 flow [2025-01-10 01:14:55,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11352, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12261, PETRI_PLACES=325, PETRI_TRANSITIONS=774} [2025-01-10 01:14:55,895 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 285 predicate places. [2025-01-10 01:14:55,895 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 774 transitions, 12261 flow [2025-01-10 01:14:55,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:55,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:55,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:55,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 01:14:55,895 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:55,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash 224752837, now seen corresponding path program 9 times [2025-01-10 01:14:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156250542] [2025-01-10 01:14:55,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:55,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:55,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:14:55,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:14:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:56,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156250542] [2025-01-10 01:14:56,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156250542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257231747] [2025-01-10 01:14:56,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:56,019 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:14:56,021 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:14:56,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:14:56,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:14:56,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:14:56,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:14:56,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:56,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257231747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:56,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 01:14:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819306894] [2025-01-10 01:14:56,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:56,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:14:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:56,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:14:56,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:56,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:14:56,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 774 transitions, 12261 flow. Second operand has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:56,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:56,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:14:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:58,868 INFO L124 PetriNetUnfolderBase]: 5384/9532 cut-off events. [2025-01-10 01:14:58,868 INFO L125 PetriNetUnfolderBase]: For 109348/109348 co-relation queries the response was YES. [2025-01-10 01:14:58,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60617 conditions, 9532 events. 5384/9532 cut-off events. For 109348/109348 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 65643 event pairs, 422 based on Foata normal form. 12/9544 useless extension candidates. Maximal degree in co-relation 60516. Up to 1692 conditions per place. [2025-01-10 01:14:58,959 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 526 selfloop transitions, 914 changer transitions 3/1444 dead transitions. [2025-01-10 01:14:58,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1444 transitions, 24258 flow [2025-01-10 01:14:58,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-10 01:14:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-01-10 01:14:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 713 transitions. [2025-01-10 01:14:58,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55703125 [2025-01-10 01:14:58,962 INFO L175 Difference]: Start difference. First operand has 325 places, 774 transitions, 12261 flow. Second operand 32 states and 713 transitions. [2025-01-10 01:14:58,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1444 transitions, 24258 flow [2025-01-10 01:14:59,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 1444 transitions, 24192 flow, removed 33 selfloop flow, removed 0 redundant places. [2025-01-10 01:14:59,678 INFO L231 Difference]: Finished difference. Result has 379 places, 1205 transitions, 22707 flow [2025-01-10 01:14:59,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12223, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=531, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=22707, PETRI_PLACES=379, PETRI_TRANSITIONS=1205} [2025-01-10 01:14:59,679 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 339 predicate places. [2025-01-10 01:14:59,679 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 1205 transitions, 22707 flow [2025-01-10 01:14:59,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:59,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:59,679 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:59,686 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:14:59,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:59,880 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:14:59,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash 969866837, now seen corresponding path program 10 times [2025-01-10 01:14:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:59,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195293407] [2025-01-10 01:14:59,881 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:59,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:59,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:59,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:59,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195293407] [2025-01-10 01:15:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195293407] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77679506] [2025-01-10 01:15:00,024 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:00,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:00,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:00,026 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:15:00,028 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:15:00,067 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:15:00,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:00,127 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:00,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:00,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:15:00,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:00,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77679506] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:00,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-01-10 01:15:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049360710] [2025-01-10 01:15:00,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:15:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:00,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:15:00,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:15:00,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:15:00,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 1205 transitions, 22707 flow. Second operand has 18 states, 18 states have (on average 15.944444444444445) internal successors, (287), 18 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:00,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:00,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:15:00,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:04,768 INFO L124 PetriNetUnfolderBase]: 6386/11212 cut-off events. [2025-01-10 01:15:04,768 INFO L125 PetriNetUnfolderBase]: For 185023/185023 co-relation queries the response was YES. [2025-01-10 01:15:04,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83242 conditions, 11212 events. 6386/11212 cut-off events. For 185023/185023 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 78797 event pairs, 371 based on Foata normal form. 146/11358 useless extension candidates. Maximal degree in co-relation 83118. Up to 1999 conditions per place. [2025-01-10 01:15:04,972 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 564 selfloop transitions, 1178 changer transitions 4/1747 dead transitions. [2025-01-10 01:15:04,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 1747 transitions, 34770 flow [2025-01-10 01:15:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-10 01:15:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-01-10 01:15:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 816 transitions. [2025-01-10 01:15:04,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5513513513513514 [2025-01-10 01:15:04,982 INFO L175 Difference]: Start difference. First operand has 379 places, 1205 transitions, 22707 flow. Second operand 37 states and 816 transitions. [2025-01-10 01:15:04,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 1747 transitions, 34770 flow [2025-01-10 01:15:07,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 1747 transitions, 32996 flow, removed 850 selfloop flow, removed 4 redundant places. [2025-01-10 01:15:07,537 INFO L231 Difference]: Finished difference. Result has 426 places, 1532 transitions, 31877 flow [2025-01-10 01:15:07,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21510, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=886, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=31877, PETRI_PLACES=426, PETRI_TRANSITIONS=1532} [2025-01-10 01:15:07,538 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 386 predicate places. [2025-01-10 01:15:07,541 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 1532 transitions, 31877 flow [2025-01-10 01:15:07,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.944444444444445) internal successors, (287), 18 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:07,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:07,541 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:07,548 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:15:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:07,742 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:15:07,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash -81729069, now seen corresponding path program 11 times [2025-01-10 01:15:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915924010] [2025-01-10 01:15:07,742 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:15:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:07,746 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:15:07,751 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:07,751 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:15:07,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915924010] [2025-01-10 01:15:07,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915924010] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:07,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547056303] [2025-01-10 01:15:07,991 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:15:07,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:07,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:07,993 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:15:07,994 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:15:08,033 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:15:08,110 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:08,110 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:15:08,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:08,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:15:08,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:08,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547056303] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:08,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-10 01:15:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105279247] [2025-01-10 01:15:08,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:15:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:08,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:15:08,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:15:08,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:15:08,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1532 transitions, 31877 flow. Second operand has 18 states, 18 states have (on average 16.0) internal successors, (288), 18 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:08,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:08,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:15:08,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:13,376 INFO L124 PetriNetUnfolderBase]: 6850/11954 cut-off events. [2025-01-10 01:15:13,377 INFO L125 PetriNetUnfolderBase]: For 202414/202414 co-relation queries the response was YES. [2025-01-10 01:15:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94688 conditions, 11954 events. 6850/11954 cut-off events. For 202414/202414 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 84455 event pairs, 1503 based on Foata normal form. 170/12124 useless extension candidates. Maximal degree in co-relation 94548. Up to 5212 conditions per place. [2025-01-10 01:15:13,588 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 881 selfloop transitions, 999 changer transitions 7/1888 dead transitions. [2025-01-10 01:15:13,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1888 transitions, 41455 flow [2025-01-10 01:15:13,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:15:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 01:15:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 680 transitions. [2025-01-10 01:15:13,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-01-10 01:15:13,591 INFO L175 Difference]: Start difference. First operand has 426 places, 1532 transitions, 31877 flow. Second operand 31 states and 680 transitions. [2025-01-10 01:15:13,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1888 transitions, 41455 flow [2025-01-10 01:15:17,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1888 transitions, 40419 flow, removed 363 selfloop flow, removed 6 redundant places. [2025-01-10 01:15:17,341 INFO L231 Difference]: Finished difference. Result has 462 places, 1686 transitions, 38210 flow [2025-01-10 01:15:17,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=30059, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=811, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=38210, PETRI_PLACES=462, PETRI_TRANSITIONS=1686} [2025-01-10 01:15:17,343 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 422 predicate places. [2025-01-10 01:15:17,343 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 1686 transitions, 38210 flow [2025-01-10 01:15:17,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.0) internal successors, (288), 18 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:17,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:17,344 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:17,353 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:15:17,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:17,545 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:15:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash -826843069, now seen corresponding path program 12 times [2025-01-10 01:15:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613937831] [2025-01-10 01:15:17,546 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:15:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:17,555 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:15:17,577 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:17,577 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:15:17,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:17,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613937831] [2025-01-10 01:15:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613937831] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820891659] [2025-01-10 01:15:17,714 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:15:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:17,716 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:15:17,717 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:15:17,758 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-01-10 01:15:17,779 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:17,779 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:15:17,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:17,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:15:17,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:17,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820891659] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:17,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:17,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 01:15:17,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766485919] [2025-01-10 01:15:17,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:15:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:17,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:15:17,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:15:17,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:15:17,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 1686 transitions, 38210 flow. Second operand has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:17,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:17,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:15:17,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:25,535 INFO L124 PetriNetUnfolderBase]: 7773/13506 cut-off events. [2025-01-10 01:15:25,535 INFO L125 PetriNetUnfolderBase]: For 270100/270100 co-relation queries the response was YES. [2025-01-10 01:15:25,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115913 conditions, 13506 events. 7773/13506 cut-off events. For 270100/270100 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 97320 event pairs, 1565 based on Foata normal form. 15/13521 useless extension candidates. Maximal degree in co-relation 115765. Up to 5676 conditions per place. [2025-01-10 01:15:25,727 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 614 selfloop transitions, 1563 changer transitions 5/2183 dead transitions. [2025-01-10 01:15:25,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 2183 transitions, 51465 flow [2025-01-10 01:15:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-10 01:15:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-01-10 01:15:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 880 transitions. [2025-01-10 01:15:25,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-01-10 01:15:25,729 INFO L175 Difference]: Start difference. First operand has 462 places, 1686 transitions, 38210 flow. Second operand 42 states and 880 transitions. [2025-01-10 01:15:25,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 2183 transitions, 51465 flow [2025-01-10 01:15:29,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 2183 transitions, 50647 flow, removed 131 selfloop flow, removed 8 redundant places. [2025-01-10 01:15:29,927 INFO L231 Difference]: Finished difference. Result has 510 places, 2039 transitions, 51295 flow [2025-01-10 01:15:29,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=37483, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=51295, PETRI_PLACES=510, PETRI_TRANSITIONS=2039} [2025-01-10 01:15:29,928 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 470 predicate places. [2025-01-10 01:15:29,929 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 2039 transitions, 51295 flow [2025-01-10 01:15:29,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:29,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:29,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:29,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-10 01:15:30,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:30,130 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:15:30,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1182422448, now seen corresponding path program 4 times [2025-01-10 01:15:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433385194] [2025-01-10 01:15:30,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:30,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:30,140 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:15:30,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:30,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:30,224 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:15:30,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433385194] [2025-01-10 01:15:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433385194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974219259] [2025-01-10 01:15:30,224 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:30,226 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:15:30,227 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:15:30,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:30,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:15:30,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:30,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:30,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:15:30,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:30,345 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:15:30,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:30,410 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:15:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974219259] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:30,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:30,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2025-01-10 01:15:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569078203] [2025-01-10 01:15:30,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:30,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:15:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:30,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:15:30,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:15:30,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:15:30,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 2039 transitions, 51295 flow. Second operand has 13 states, 13 states have (on average 16.923076923076923) internal successors, (220), 13 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:30,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:30,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:15:30,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:38,421 INFO L124 PetriNetUnfolderBase]: 8662/14940 cut-off events. [2025-01-10 01:15:38,422 INFO L125 PetriNetUnfolderBase]: For 352725/352725 co-relation queries the response was YES. [2025-01-10 01:15:38,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139478 conditions, 14940 events. 8662/14940 cut-off events. For 352725/352725 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 108466 event pairs, 549 based on Foata normal form. 135/15075 useless extension candidates. Maximal degree in co-relation 139320. Up to 3518 conditions per place. [2025-01-10 01:15:38,755 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 1153 selfloop transitions, 1259 changer transitions 2/2415 dead transitions. [2025-01-10 01:15:38,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 2415 transitions, 63952 flow [2025-01-10 01:15:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:15:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 01:15:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 502 transitions. [2025-01-10 01:15:38,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5704545454545454 [2025-01-10 01:15:38,758 INFO L175 Difference]: Start difference. First operand has 510 places, 2039 transitions, 51295 flow. Second operand 22 states and 502 transitions. [2025-01-10 01:15:38,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 2415 transitions, 63952 flow [2025-01-10 01:15:46,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 2415 transitions, 63101 flow, removed 257 selfloop flow, removed 11 redundant places. [2025-01-10 01:15:46,290 INFO L231 Difference]: Finished difference. Result has 532 places, 2235 transitions, 60481 flow [2025-01-10 01:15:46,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=49342, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=856, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=60481, PETRI_PLACES=532, PETRI_TRANSITIONS=2235} [2025-01-10 01:15:46,292 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 492 predicate places. [2025-01-10 01:15:46,292 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 2235 transitions, 60481 flow [2025-01-10 01:15:46,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.923076923076923) internal successors, (220), 13 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:46,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:46,293 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:46,299 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:15:46,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:46,497 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 01:15:46,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1395578682, now seen corresponding path program 1 times [2025-01-10 01:15:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140617478] [2025-01-10 01:15:46,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:15:46,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:15:46,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140617478] [2025-01-10 01:15:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140617478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601165268] [2025-01-10 01:15:46,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:46,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:46,643 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:15:46,645 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:15:46,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:15:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:15:46,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:46,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:46,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:15:46,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:46,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601165268] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:46,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:46,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-01-10 01:15:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849501174] [2025-01-10 01:15:46,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:46,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:15:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:46,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:15:46,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:15:46,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-01-10 01:15:46,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 2235 transitions, 60481 flow. Second operand has 15 states, 15 states have (on average 16.2) internal successors, (243), 15 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:46,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:46,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-01-10 01:15:46,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand