./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:13:15,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:13:15,668 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:13:15,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:13:15,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:13:15,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:13:15,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:13:15,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:13:15,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:13:15,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:13:15,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:13:15,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:13:15,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:13:15,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:13:15,700 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:13:15,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:13:15,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:13:15,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:13:15,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:13:15,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:13:15,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:13:15,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:15,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:15,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:15,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:15,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:13:15,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:15,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:13:15,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:13:15,703 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-01-10 01:13:15,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:13:15,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:13:15,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:13:15,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:13:15,967 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:13:15,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-01-10 01:13:17,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71a97902a/6667fd4905414dc8b0ef1840c0a6f9e1/FLAG9cc21699c [2025-01-10 01:13:17,368 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:13:17,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-01-10 01:13:17,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71a97902a/6667fd4905414dc8b0ef1840c0a6f9e1/FLAG9cc21699c [2025-01-10 01:13:17,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71a97902a/6667fd4905414dc8b0ef1840c0a6f9e1 [2025-01-10 01:13:17,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:13:17,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:13:17,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:17,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:13:17,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:13:17,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f794e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17, skipping insertion in model container [2025-01-10 01:13:17,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:13:17,860 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:13:17,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:17,874 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:13:17,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:17,907 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:13:17,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17 WrapperNode [2025-01-10 01:13:17,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:17,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:17,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:13:17,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:13:17,914 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:13:17" (1/1) ... [2025-01-10 01:13:17,923 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:13:17" (1/1) ... [2025-01-10 01:13:17,950 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 212 [2025-01-10 01:13:17,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:17,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:13:17,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:13:17,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:13:17,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,982 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 01:13:17,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:13:17,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:13:17,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:13:17,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:13:17,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:18,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:18,023 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:13:18,025 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:13:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:13:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:13:18,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:13:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:13:18,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:13:18,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:13:18,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:13:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:13:18,043 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:13:18,128 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:13:18,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:13:18,580 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:13:18,580 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:13:18,864 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:13:18,864 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:13:18,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:18 BoogieIcfgContainer [2025-01-10 01:13:18,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:13:18,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:13:18,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:13:18,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:13:18,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:13:17" (1/3) ... [2025-01-10 01:13:18,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d12b075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:18, skipping insertion in model container [2025-01-10 01:13:18,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17" (2/3) ... [2025-01-10 01:13:18,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d12b075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:18, skipping insertion in model container [2025-01-10 01:13:18,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:18" (3/3) ... [2025-01-10 01:13:18,871 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-01-10 01:13:18,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:13:18,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 81 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-01-10 01:13:18,882 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:13:18,933 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:13:18,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 199 flow [2025-01-10 01:13:19,004 INFO L124 PetriNetUnfolderBase]: 9/86 cut-off events. [2025-01-10 01:13:19,009 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:13:19,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 9/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 253 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-01-10 01:13:19,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 199 flow [2025-01-10 01:13:19,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 188 flow [2025-01-10 01:13:19,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:13:19,033 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;@25f49656, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:13:19,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-01-10 01:13:19,036 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:13:19,036 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:13:19,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:13:19,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:19,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:19,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 867145, now seen corresponding path program 1 times [2025-01-10 01:13:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355863888] [2025-01-10 01:13:19,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:19,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:19,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:19,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:19,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:19,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:13:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355863888] [2025-01-10 01:13:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355863888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:19,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:13:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917068490] [2025-01-10 01:13:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:19,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:19,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:19,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:19,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:19,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:19,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:19,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:19,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:19,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:19,837 INFO L124 PetriNetUnfolderBase]: 2958/4632 cut-off events. [2025-01-10 01:13:19,837 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-10 01:13:19,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 4632 events. 2958/4632 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29775 event pairs, 2134 based on Foata normal form. 1/3242 useless extension candidates. Maximal degree in co-relation 8216. Up to 3883 conditions per place. [2025-01-10 01:13:19,897 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 46 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-01-10 01:13:19,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 270 flow [2025-01-10 01:13:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 01:13:19,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5842696629213483 [2025-01-10 01:13:19,912 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 188 flow. Second operand 3 states and 156 transitions. [2025-01-10 01:13:19,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 270 flow [2025-01-10 01:13:19,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 258 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:19,927 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-01-10 01:13:19,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-01-10 01:13:19,936 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2025-01-10 01:13:19,936 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-01-10 01:13:19,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:19,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:19,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:19,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:13:19,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash 867146, now seen corresponding path program 1 times [2025-01-10 01:13:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077946181] [2025-01-10 01:13:19,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:19,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:19,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:19,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:19,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:20,186 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:13:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077946181] [2025-01-10 01:13:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077946181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:20,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:20,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930319338] [2025-01-10 01:13:20,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:20,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:20,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:20,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:20,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:20,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:20,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:20,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:20,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:20,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:20,774 INFO L124 PetriNetUnfolderBase]: 2959/4635 cut-off events. [2025-01-10 01:13:20,775 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:13:20,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 4635 events. 2959/4635 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29824 event pairs, 2134 based on Foata normal form. 0/3241 useless extension candidates. Maximal degree in co-relation 8578. Up to 3896 conditions per place. [2025-01-10 01:13:20,811 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 51 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-01-10 01:13:20,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 280 flow [2025-01-10 01:13:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-01-10 01:13:20,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5880149812734082 [2025-01-10 01:13:20,815 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 3 states and 157 transitions. [2025-01-10 01:13:20,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 280 flow [2025-01-10 01:13:20,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:20,817 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 181 flow [2025-01-10 01:13:20,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2025-01-10 01:13:20,819 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2025-01-10 01:13:20,819 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 181 flow [2025-01-10 01:13:20,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:20,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:20,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:13:20,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:13:20,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:20,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:20,820 INFO L85 PathProgramCache]: Analyzing trace with hash 26883705, now seen corresponding path program 1 times [2025-01-10 01:13:20,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:20,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256309079] [2025-01-10 01:13:20,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:20,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:13:20,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:13:20,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:20,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:20,923 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:13:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256309079] [2025-01-10 01:13:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256309079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649007944] [2025-01-10 01:13:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:20,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:20,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:20,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:20,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:20,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:21,243 INFO L124 PetriNetUnfolderBase]: 2958/4634 cut-off events. [2025-01-10 01:13:21,244 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:13:21,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 4634 events. 2958/4634 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29770 event pairs, 2134 based on Foata normal form. 1/3245 useless extension candidates. Maximal degree in co-relation 8602. Up to 3892 conditions per place. [2025-01-10 01:13:21,271 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 48 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2025-01-10 01:13:21,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 278 flow [2025-01-10 01:13:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 01:13:21,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6067415730337079 [2025-01-10 01:13:21,275 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 181 flow. Second operand 3 states and 162 transitions. [2025-01-10 01:13:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 278 flow [2025-01-10 01:13:21,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:21,276 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 178 flow [2025-01-10 01:13:21,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2025-01-10 01:13:21,278 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2025-01-10 01:13:21,278 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 178 flow [2025-01-10 01:13:21,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:21,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:21,279 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:13:21,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:13:21,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:21,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash 833356460, now seen corresponding path program 1 times [2025-01-10 01:13:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30173027] [2025-01-10 01:13:21,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:21,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:21,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:21,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:21,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:21,488 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:13:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30173027] [2025-01-10 01:13:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30173027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535785143] [2025-01-10 01:13:21,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:21,492 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:13:21,493 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:13:21,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:21,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:21,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:21,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:21,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:13:21,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:21,612 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:13:21,792 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:13:21,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:21,898 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:13:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535785143] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:21,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:13:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531645100] [2025-01-10 01:13:21,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:21,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:13:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:21,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:13:21,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:22,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:22,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 178 flow. Second operand has 11 states, 11 states have (on average 35.36363636363637) internal successors, (389), 11 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:22,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:22,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:22,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:22,639 INFO L124 PetriNetUnfolderBase]: 2958/4633 cut-off events. [2025-01-10 01:13:22,639 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 01:13:22,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8616 conditions, 4633 events. 2958/4633 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29821 event pairs, 2134 based on Foata normal form. 0/3241 useless extension candidates. Maximal degree in co-relation 8602. Up to 3891 conditions per place. [2025-01-10 01:13:22,663 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 47 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2025-01-10 01:13:22,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 280 flow [2025-01-10 01:13:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2025-01-10 01:13:22,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.501123595505618 [2025-01-10 01:13:22,666 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 178 flow. Second operand 5 states and 223 transitions. [2025-01-10 01:13:22,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 280 flow [2025-01-10 01:13:22,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:22,668 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 188 flow [2025-01-10 01:13:22,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-01-10 01:13:22,668 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-01-10 01:13:22,668 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 188 flow [2025-01-10 01:13:22,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.36363636363637) internal successors, (389), 11 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:22,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:22,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:13:22,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:22,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:22,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:22,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash 64248663, now seen corresponding path program 1 times [2025-01-10 01:13:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74913000] [2025-01-10 01:13:22,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:22,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:22,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:22,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:22,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:23,042 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:13:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:23,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74913000] [2025-01-10 01:13:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74913000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658813280] [2025-01-10 01:13:23,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:23,045 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:13:23,047 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:13:23,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:23,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:23,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:23,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:13:23,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:23,105 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:13:23,209 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:13:23,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:13:23,224 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:13:23,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:23,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658813280] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:23,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2025-01-10 01:13:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212802388] [2025-01-10 01:13:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:23,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:23,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:23,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:23,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:23,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:23,728 INFO L124 PetriNetUnfolderBase]: 2960/4639 cut-off events. [2025-01-10 01:13:23,729 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 01:13:23,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8635 conditions, 4639 events. 2960/4639 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29827 event pairs, 2134 based on Foata normal form. 0/3245 useless extension candidates. Maximal degree in co-relation 8606. Up to 3894 conditions per place. [2025-01-10 01:13:23,750 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 51 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2025-01-10 01:13:23,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 85 transitions, 316 flow [2025-01-10 01:13:23,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-01-10 01:13:23,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.550561797752809 [2025-01-10 01:13:23,751 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 188 flow. Second operand 4 states and 196 transitions. [2025-01-10 01:13:23,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 85 transitions, 316 flow [2025-01-10 01:13:23,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 306 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:23,753 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 225 flow [2025-01-10 01:13:23,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2025-01-10 01:13:23,754 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -5 predicate places. [2025-01-10 01:13:23,754 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 225 flow [2025-01-10 01:13:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:23,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:23,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:23,762 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:13:23,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:23,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:23,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1991709240, now seen corresponding path program 1 times [2025-01-10 01:13:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:23,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735927426] [2025-01-10 01:13:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:23,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:13:23,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:13:23,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:23,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:24,035 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:13:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735927426] [2025-01-10 01:13:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735927426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:24,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:24,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935162537] [2025-01-10 01:13:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:24,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:24,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:24,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:24,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 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:13:24,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:24,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:24,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:24,308 INFO L124 PetriNetUnfolderBase]: 2958/4637 cut-off events. [2025-01-10 01:13:24,308 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 01:13:24,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8641 conditions, 4637 events. 2958/4637 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29823 event pairs, 2134 based on Foata normal form. 2/3251 useless extension candidates. Maximal degree in co-relation 8611. Up to 3891 conditions per place. [2025-01-10 01:13:24,329 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 48 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-01-10 01:13:24,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 327 flow [2025-01-10 01:13:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2025-01-10 01:13:24,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5730337078651685 [2025-01-10 01:13:24,331 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 225 flow. Second operand 4 states and 204 transitions. [2025-01-10 01:13:24,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 327 flow [2025-01-10 01:13:24,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:24,333 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 221 flow [2025-01-10 01:13:24,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-01-10 01:13:24,333 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2025-01-10 01:13:24,333 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 221 flow [2025-01-10 01:13:24,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 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:13:24,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:24,334 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:24,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:13:24,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1613450598, now seen corresponding path program 1 times [2025-01-10 01:13:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520908384] [2025-01-10 01:13:24,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:13:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:13:24,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:24,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520908384] [2025-01-10 01:13:24,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520908384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597170957] [2025-01-10 01:13:24,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:24,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:24,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:24,438 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:13:24,443 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:13:24,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:13:24,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:13:24,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:24,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:13:24,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:24,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597170957] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:24,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:13:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879089670] [2025-01-10 01:13:24,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:13:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:24,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:13:24,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:13:24,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:24,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 221 flow. Second operand has 13 states, 13 states have (on average 38.53846153846154) internal successors, (501), 13 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:24,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:24,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:24,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:25,274 INFO L124 PetriNetUnfolderBase]: 5915/9273 cut-off events. [2025-01-10 01:13:25,275 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-01-10 01:13:25,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17276 conditions, 9273 events. 5915/9273 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 63909 event pairs, 4268 based on Foata normal form. 2/6508 useless extension candidates. Maximal degree in co-relation 8634. Up to 3889 conditions per place. [2025-01-10 01:13:25,314 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 85 selfloop transitions, 22 changer transitions 0/136 dead transitions. [2025-01-10 01:13:25,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 136 transitions, 592 flow [2025-01-10 01:13:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 405 transitions. [2025-01-10 01:13:25,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5688202247191011 [2025-01-10 01:13:25,317 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 221 flow. Second operand 8 states and 405 transitions. [2025-01-10 01:13:25,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 136 transitions, 592 flow [2025-01-10 01:13:25,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 136 transitions, 570 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:25,321 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 338 flow [2025-01-10 01:13:25,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2025-01-10 01:13:25,322 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-01-10 01:13:25,322 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 338 flow [2025-01-10 01:13:25,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.53846153846154) internal successors, (501), 13 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:25,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:25,322 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:13:25,328 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:13:25,523 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:13:25,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:25,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1125395644, now seen corresponding path program 2 times [2025-01-10 01:13:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:25,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325377871] [2025-01-10 01:13:25,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:25,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:25,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:13:25,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:13:25,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:25,759 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:13:25,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:25,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325377871] [2025-01-10 01:13:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325377871] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:25,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747704965] [2025-01-10 01:13:25,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:25,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:25,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:25,763 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:13:25,764 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:13:25,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:13:25,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:13:25,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:25,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:25,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:13:25,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:25,832 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:13:25,926 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:13:25,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:13:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:25,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747704965] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:26,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-01-10 01:13:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559835278] [2025-01-10 01:13:26,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:26,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:13:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:26,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:13:26,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:13:26,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:26,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 338 flow. Second operand has 16 states, 16 states have (on average 35.75) internal successors, (572), 16 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:26,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:26,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:26,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:28,048 INFO L124 PetriNetUnfolderBase]: 8868/13887 cut-off events. [2025-01-10 01:13:28,048 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-10 01:13:28,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25876 conditions, 13887 events. 8868/13887 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 103039 event pairs, 6402 based on Foata normal form. 5/9744 useless extension candidates. Maximal degree in co-relation 17219. Up to 7764 conditions per place. [2025-01-10 01:13:28,112 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 81 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-01-10 01:13:28,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 641 flow [2025-01-10 01:13:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:13:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:13:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 451 transitions. [2025-01-10 01:13:28,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5067415730337078 [2025-01-10 01:13:28,114 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 338 flow. Second operand 10 states and 451 transitions. [2025-01-10 01:13:28,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 641 flow [2025-01-10 01:13:28,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 607 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:28,116 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 359 flow [2025-01-10 01:13:28,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2025-01-10 01:13:28,119 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2025-01-10 01:13:28,119 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 359 flow [2025-01-10 01:13:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.75) internal successors, (572), 16 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:28,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:28,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:28,127 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:13:28,320 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:13:28,320 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:28,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1328416655, now seen corresponding path program 1 times [2025-01-10 01:13:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267812651] [2025-01-10 01:13:28,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:28,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:28,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:28,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:28,637 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:13:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267812651] [2025-01-10 01:13:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267812651] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058038202] [2025-01-10 01:13:28,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:28,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:28,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:28,640 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:13:28,641 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:13:28,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:28,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:28,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:28,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:28,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 01:13:28,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:28,718 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:13:28,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:13:28,781 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:13:28,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-01-10 01:13:28,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:28,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:13:28,921 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-01-10 01:13:28,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-01-10 01:13:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:29,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058038202] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:29,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:29,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2025-01-10 01:13:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318971375] [2025-01-10 01:13:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:29,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:13:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:29,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:13:29,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:29,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:29,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:29,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:29,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:29,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:32,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:33,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:37,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:39,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:39,876 INFO L124 PetriNetUnfolderBase]: 8868/13881 cut-off events. [2025-01-10 01:13:39,876 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-01-10 01:13:39,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25888 conditions, 13881 events. 8868/13881 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 102244 event pairs, 6402 based on Foata normal form. 0/9725 useless extension candidates. Maximal degree in co-relation 17223. Up to 11649 conditions per place. [2025-01-10 01:13:39,949 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 60 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-01-10 01:13:39,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 499 flow [2025-01-10 01:13:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2025-01-10 01:13:39,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4812734082397004 [2025-01-10 01:13:39,955 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 359 flow. Second operand 6 states and 257 transitions. [2025-01-10 01:13:39,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 499 flow [2025-01-10 01:13:39,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 452 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:39,958 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 324 flow [2025-01-10 01:13:39,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2025-01-10 01:13:39,959 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 6 predicate places. [2025-01-10 01:13:39,959 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 324 flow [2025-01-10 01:13:39,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:39,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:39,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:39,968 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:13:40,160 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:13:40,160 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1328416654, now seen corresponding path program 1 times [2025-01-10 01:13:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8466592] [2025-01-10 01:13:40,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:40,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:40,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:40,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:40,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:40,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8466592] [2025-01-10 01:13:40,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8466592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:40,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:40,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:40,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836817675] [2025-01-10 01:13:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:40,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:40,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:40,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:40,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:40,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 89 [2025-01-10 01:13:40,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:40,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:40,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 89 [2025-01-10 01:13:40,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:40,967 INFO L124 PetriNetUnfolderBase]: 8967/14379 cut-off events. [2025-01-10 01:13:40,967 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 01:13:40,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26537 conditions, 14379 events. 8967/14379 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 105933 event pairs, 6564 based on Foata normal form. 0/10220 useless extension candidates. Maximal degree in co-relation 17660. Up to 11808 conditions per place. [2025-01-10 01:13:41,016 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 61 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2025-01-10 01:13:41,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 448 flow [2025-01-10 01:13:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2025-01-10 01:13:41,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43595505617977526 [2025-01-10 01:13:41,017 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 324 flow. Second operand 5 states and 194 transitions. [2025-01-10 01:13:41,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 448 flow [2025-01-10 01:13:41,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 439 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:41,019 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 317 flow [2025-01-10 01:13:41,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2025-01-10 01:13:41,019 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-01-10 01:13:41,019 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 317 flow [2025-01-10 01:13:41,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:41,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:41,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:13:41,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:41,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1768755762, now seen corresponding path program 1 times [2025-01-10 01:13:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:41,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060980680] [2025-01-10 01:13:41,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:41,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:41,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:41,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:41,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:41,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060980680] [2025-01-10 01:13:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060980680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:41,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:41,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:13:41,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096511632] [2025-01-10 01:13:41,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:41,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:41,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:41,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:41,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 89 [2025-01-10 01:13:41,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:41,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:41,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 89 [2025-01-10 01:13:41,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:41,709 INFO L124 PetriNetUnfolderBase]: 8124/12675 cut-off events. [2025-01-10 01:13:41,709 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-10 01:13:41,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23756 conditions, 12675 events. 8124/12675 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 89234 event pairs, 5934 based on Foata normal form. 0/9257 useless extension candidates. Maximal degree in co-relation 15805. Up to 10752 conditions per place. [2025-01-10 01:13:41,763 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 59 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-01-10 01:13:41,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 437 flow [2025-01-10 01:13:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2025-01-10 01:13:41,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44269662921348313 [2025-01-10 01:13:41,765 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 317 flow. Second operand 5 states and 197 transitions. [2025-01-10 01:13:41,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 437 flow [2025-01-10 01:13:41,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:41,766 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 310 flow [2025-01-10 01:13:41,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2025-01-10 01:13:41,767 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2025-01-10 01:13:41,767 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 310 flow [2025-01-10 01:13:41,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:41,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:41,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:41,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:13:41,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1768755761, now seen corresponding path program 1 times [2025-01-10 01:13:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:41,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512758814] [2025-01-10 01:13:41,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:41,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:41,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:41,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:41,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512758814] [2025-01-10 01:13:41,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512758814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425994466] [2025-01-10 01:13:41,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:41,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:41,915 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:13:41,916 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:13:41,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:41,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:41,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:41,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:41,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:13:41,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:41,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:13:42,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:42,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:13:42,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:42,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:13:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:42,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:42,137 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 52 treesize of output 48 [2025-01-10 01:13:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425994466] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:42,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:13:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883566704] [2025-01-10 01:13:42,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:42,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:13:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:42,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:13:42,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:13:42,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 89 [2025-01-10 01:13:42,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:42,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:42,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 89 [2025-01-10 01:13:42,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:43,431 INFO L124 PetriNetUnfolderBase]: 7110/11127 cut-off events. [2025-01-10 01:13:43,431 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-10 01:13:43,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20780 conditions, 11127 events. 7110/11127 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 79135 event pairs, 5070 based on Foata normal form. 0/8057 useless extension candidates. Maximal degree in co-relation 13822. Up to 9348 conditions per place. [2025-01-10 01:13:43,473 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 53 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2025-01-10 01:13:43,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 454 flow [2025-01-10 01:13:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 310 transitions. [2025-01-10 01:13:43,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4353932584269663 [2025-01-10 01:13:43,475 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 310 flow. Second operand 8 states and 310 transitions. [2025-01-10 01:13:43,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 454 flow [2025-01-10 01:13:43,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 81 transitions, 445 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:43,476 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 323 flow [2025-01-10 01:13:43,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2025-01-10 01:13:43,476 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 0 predicate places. [2025-01-10 01:13:43,477 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 323 flow [2025-01-10 01:13:43,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:43,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:43,477 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:13:43,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:13:43,682 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,SelfDestructingSolverStorable11 [2025-01-10 01:13:43,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:43,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:43,682 INFO L85 PathProgramCache]: Analyzing trace with hash -82751334, now seen corresponding path program 1 times [2025-01-10 01:13:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69692683] [2025-01-10 01:13:43,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:43,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:43,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:13:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:13:43,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:43,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69692683] [2025-01-10 01:13:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69692683] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145653931] [2025-01-10 01:13:43,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:43,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:43,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:43,778 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:13:43,779 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:13:43,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:13:43,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:13:43,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:43,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:13:43,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:43,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145653931] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:43,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:43,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:13:43,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985231917] [2025-01-10 01:13:43,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:43,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:13:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:43,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:13:43,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:13:44,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:44,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 323 flow. Second operand has 12 states, 12 states have (on average 38.333333333333336) internal successors, (460), 12 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:44,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:44,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:44,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:44,474 INFO L124 PetriNetUnfolderBase]: 4444/7101 cut-off events. [2025-01-10 01:13:44,475 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-01-10 01:13:44,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13381 conditions, 7101 events. 4444/7101 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 47009 event pairs, 2594 based on Foata normal form. 0/5124 useless extension candidates. Maximal degree in co-relation 10557. Up to 3511 conditions per place. [2025-01-10 01:13:44,505 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 92 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2025-01-10 01:13:44,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 129 transitions, 673 flow [2025-01-10 01:13:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 440 transitions. [2025-01-10 01:13:44,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493133583021224 [2025-01-10 01:13:44,506 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 323 flow. Second operand 9 states and 440 transitions. [2025-01-10 01:13:44,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 129 transitions, 673 flow [2025-01-10 01:13:44,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 666 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:44,508 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 378 flow [2025-01-10 01:13:44,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2025-01-10 01:13:44,509 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 7 predicate places. [2025-01-10 01:13:44,509 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 378 flow [2025-01-10 01:13:44,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.333333333333336) internal successors, (460), 12 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:44,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:44,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:44,516 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:13:44,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:44,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2008862125, now seen corresponding path program 1 times [2025-01-10 01:13:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-01-10 01:13:44,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:44,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:44,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:13:44,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:13:44,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:44,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-01-10 01:13:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495241362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494085694] [2025-01-10 01:13:44,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:44,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:44,806 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:13:44,808 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:13:44,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:13:44,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:13:44,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:44,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:44,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:13:44,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:44,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:44,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494085694] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:44,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:13:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000567635] [2025-01-10 01:13:44,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:44,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:13:44,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:44,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:13:44,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:13:45,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:45,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 378 flow. Second operand has 12 states, 12 states have (on average 38.583333333333336) internal successors, (463), 12 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:45,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:45,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:45,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:45,431 INFO L124 PetriNetUnfolderBase]: 3247/5200 cut-off events. [2025-01-10 01:13:45,431 INFO L125 PetriNetUnfolderBase]: For 910/1036 co-relation queries the response was YES. [2025-01-10 01:13:45,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10448 conditions, 5200 events. 3247/5200 cut-off events. For 910/1036 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 30902 event pairs, 2162 based on Foata normal form. 0/3886 useless extension candidates. Maximal degree in co-relation 9202. Up to 3506 conditions per place. [2025-01-10 01:13:45,448 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 79 selfloop transitions, 23 changer transitions 0/116 dead transitions. [2025-01-10 01:13:45,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 116 transitions, 680 flow [2025-01-10 01:13:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 427 transitions. [2025-01-10 01:13:45,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.533083645443196 [2025-01-10 01:13:45,450 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 378 flow. Second operand 9 states and 427 transitions. [2025-01-10 01:13:45,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 116 transitions, 680 flow [2025-01-10 01:13:45,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 116 transitions, 640 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:45,452 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 400 flow [2025-01-10 01:13:45,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=400, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-01-10 01:13:45,455 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 11 predicate places. [2025-01-10 01:13:45,455 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 400 flow [2025-01-10 01:13:45,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.583333333333336) internal successors, (463), 12 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:45,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:45,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:45,461 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:13:45,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:45,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -523800224, now seen corresponding path program 1 times [2025-01-10 01:13:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901838920] [2025-01-10 01:13:45,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:45,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:45,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:13:45,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:13:45,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:45,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:45,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901838920] [2025-01-10 01:13:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901838920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11234829] [2025-01-10 01:13:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:45,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:45,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:45,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:45,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:45,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:45,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:45,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:45,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:45,965 INFO L124 PetriNetUnfolderBase]: 2458/3867 cut-off events. [2025-01-10 01:13:45,965 INFO L125 PetriNetUnfolderBase]: For 1303/1404 co-relation queries the response was YES. [2025-01-10 01:13:45,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 3867 events. 2458/3867 cut-off events. For 1303/1404 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 22036 event pairs, 1866 based on Foata normal form. 0/3093 useless extension candidates. Maximal degree in co-relation 7333. Up to 3348 conditions per place. [2025-01-10 01:13:45,984 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 62 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-01-10 01:13:45,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 81 transitions, 528 flow [2025-01-10 01:13:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-01-10 01:13:45,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5112359550561798 [2025-01-10 01:13:45,986 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 400 flow. Second operand 4 states and 182 transitions. [2025-01-10 01:13:45,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 81 transitions, 528 flow [2025-01-10 01:13:45,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 81 transitions, 488 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:45,991 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 364 flow [2025-01-10 01:13:45,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2025-01-10 01:13:45,992 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 6 predicate places. [2025-01-10 01:13:45,992 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 364 flow [2025-01-10 01:13:45,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:45,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:45,992 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:45,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:13:45,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:45,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash -172419327, now seen corresponding path program 2 times [2025-01-10 01:13:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816286926] [2025-01-10 01:13:45,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:46,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:13:46,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-01-10 01:13:46,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:46,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:46,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:46,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816286926] [2025-01-10 01:13:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816286926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:46,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:46,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:13:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838524008] [2025-01-10 01:13:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:46,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:13:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:46,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:13:46,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:13:46,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 89 [2025-01-10 01:13:46,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:46,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:46,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 89 [2025-01-10 01:13:46,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:47,038 INFO L124 PetriNetUnfolderBase]: 5216/8143 cut-off events. [2025-01-10 01:13:47,038 INFO L125 PetriNetUnfolderBase]: For 1568/1777 co-relation queries the response was YES. [2025-01-10 01:13:47,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17442 conditions, 8143 events. 5216/8143 cut-off events. For 1568/1777 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 51599 event pairs, 1650 based on Foata normal form. 0/6023 useless extension candidates. Maximal degree in co-relation 16168. Up to 4539 conditions per place. [2025-01-10 01:13:47,079 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 105 selfloop transitions, 12 changer transitions 0/127 dead transitions. [2025-01-10 01:13:47,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 714 flow [2025-01-10 01:13:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:13:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:13:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2025-01-10 01:13:47,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41091492776886035 [2025-01-10 01:13:47,080 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 364 flow. Second operand 7 states and 256 transitions. [2025-01-10 01:13:47,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 714 flow [2025-01-10 01:13:47,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:47,085 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 410 flow [2025-01-10 01:13:47,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2025-01-10 01:13:47,086 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 12 predicate places. [2025-01-10 01:13:47,086 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 410 flow [2025-01-10 01:13:47,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:47,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:47,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:47,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:13:47,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:47,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -523800223, now seen corresponding path program 1 times [2025-01-10 01:13:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:47,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283581487] [2025-01-10 01:13:47,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:47,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:13:47,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:13:47,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:47,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:47,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:47,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283581487] [2025-01-10 01:13:47,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283581487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:47,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249230710] [2025-01-10 01:13:47,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:47,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:47,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:47,170 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:13:47,172 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:13:47,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:13:47,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:13:47,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:47,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:47,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:13:47,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:47,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249230710] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:47,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:13:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120859747] [2025-01-10 01:13:47,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:47,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:13:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:47,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:13:47,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:13:47,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:47,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 410 flow. Second operand has 12 states, 12 states have (on average 38.75) internal successors, (465), 12 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:47,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:47,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:47,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:47,877 INFO L124 PetriNetUnfolderBase]: 4044/6506 cut-off events. [2025-01-10 01:13:47,878 INFO L125 PetriNetUnfolderBase]: For 2894/3387 co-relation queries the response was YES. [2025-01-10 01:13:47,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14504 conditions, 6506 events. 4044/6506 cut-off events. For 2894/3387 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40903 event pairs, 2375 based on Foata normal form. 98/5039 useless extension candidates. Maximal degree in co-relation 13665. Up to 4274 conditions per place. [2025-01-10 01:13:47,902 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 91 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2025-01-10 01:13:47,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 129 transitions, 795 flow [2025-01-10 01:13:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:13:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:13:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 471 transitions. [2025-01-10 01:13:47,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292134831460674 [2025-01-10 01:13:47,904 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 410 flow. Second operand 10 states and 471 transitions. [2025-01-10 01:13:47,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 129 transitions, 795 flow [2025-01-10 01:13:47,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 767 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:47,909 INFO L231 Difference]: Finished difference. Result has 106 places, 86 transitions, 462 flow [2025-01-10 01:13:47,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=462, PETRI_PLACES=106, PETRI_TRANSITIONS=86} [2025-01-10 01:13:47,909 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 20 predicate places. [2025-01-10 01:13:47,909 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 462 flow [2025-01-10 01:13:47,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.75) internal successors, (465), 12 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:47,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:47,910 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:47,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:48,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:48,111 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1808778181, now seen corresponding path program 1 times [2025-01-10 01:13:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033510084] [2025-01-10 01:13:48,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:48,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:48,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:48,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:48,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033510084] [2025-01-10 01:13:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033510084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201976244] [2025-01-10 01:13:48,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:48,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:48,297 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:13:48,299 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:13:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:48,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 01:13:48,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:48,389 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:13:48,461 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-10 01:13:48,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-01-10 01:13:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:13:48,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201976244] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:48,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 19 [2025-01-10 01:13:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392319497] [2025-01-10 01:13:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:48,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:13:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:48,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:13:48,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:13:49,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:49,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:49,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:49,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:49,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:49,711 INFO L124 PetriNetUnfolderBase]: 4302/6527 cut-off events. [2025-01-10 01:13:49,712 INFO L125 PetriNetUnfolderBase]: For 2316/2680 co-relation queries the response was YES. [2025-01-10 01:13:49,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15269 conditions, 6527 events. 4302/6527 cut-off events. For 2316/2680 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 36947 event pairs, 1646 based on Foata normal form. 74/5155 useless extension candidates. Maximal degree in co-relation 14378. Up to 3277 conditions per place. [2025-01-10 01:13:49,744 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 94 selfloop transitions, 24 changer transitions 0/131 dead transitions. [2025-01-10 01:13:49,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 131 transitions, 857 flow [2025-01-10 01:13:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:13:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:13:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 481 transitions. [2025-01-10 01:13:49,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.491317671092952 [2025-01-10 01:13:49,746 INFO L175 Difference]: Start difference. First operand has 106 places, 86 transitions, 462 flow. Second operand 11 states and 481 transitions. [2025-01-10 01:13:49,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 131 transitions, 857 flow [2025-01-10 01:13:49,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 131 transitions, 829 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:49,751 INFO L231 Difference]: Finished difference. Result has 113 places, 89 transitions, 528 flow [2025-01-10 01:13:49,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=528, PETRI_PLACES=113, PETRI_TRANSITIONS=89} [2025-01-10 01:13:49,752 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 27 predicate places. [2025-01-10 01:13:49,752 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 89 transitions, 528 flow [2025-01-10 01:13:49,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:49,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:49,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:49,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:13:49,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:13:49,952 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:49,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1737266772, now seen corresponding path program 2 times [2025-01-10 01:13:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666639408] [2025-01-10 01:13:49,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:49,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:13:49,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 26 statements. [2025-01-10 01:13:49,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:49,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666639408] [2025-01-10 01:13:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666639408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:50,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:50,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:13:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958028718] [2025-01-10 01:13:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:50,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:13:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:50,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:13:50,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:13:50,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 89 [2025-01-10 01:13:50,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 89 transitions, 528 flow. Second operand has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:50,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:50,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 89 [2025-01-10 01:13:50,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:51,222 INFO L124 PetriNetUnfolderBase]: 7536/10847 cut-off events. [2025-01-10 01:13:51,223 INFO L125 PetriNetUnfolderBase]: For 8351/8769 co-relation queries the response was YES. [2025-01-10 01:13:51,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27323 conditions, 10847 events. 7536/10847 cut-off events. For 8351/8769 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 61744 event pairs, 3415 based on Foata normal form. 172/8204 useless extension candidates. Maximal degree in co-relation 26373. Up to 6305 conditions per place. [2025-01-10 01:13:51,289 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 118 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2025-01-10 01:13:51,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 143 transitions, 1016 flow [2025-01-10 01:13:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:13:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:13:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 267 transitions. [2025-01-10 01:13:51,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-01-10 01:13:51,290 INFO L175 Difference]: Start difference. First operand has 113 places, 89 transitions, 528 flow. Second operand 7 states and 267 transitions. [2025-01-10 01:13:51,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 143 transitions, 1016 flow [2025-01-10 01:13:51,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 143 transitions, 1006 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:51,300 INFO L231 Difference]: Finished difference. Result has 119 places, 92 transitions, 567 flow [2025-01-10 01:13:51,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=119, PETRI_TRANSITIONS=92} [2025-01-10 01:13:51,301 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 33 predicate places. [2025-01-10 01:13:51,301 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 92 transitions, 567 flow [2025-01-10 01:13:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:51,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:51,301 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:51,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:13:51,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1737266774, now seen corresponding path program 1 times [2025-01-10 01:13:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468409862] [2025-01-10 01:13:51,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:51,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:51,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:51,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:51,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:51,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468409862] [2025-01-10 01:13:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468409862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:51,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177119834] [2025-01-10 01:13:51,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:51,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:51,468 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:13:51,470 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:13:51,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:51,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:51,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:51,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:51,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:13:51,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:51,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:13:51,561 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:13:51,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:51,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:13:51,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-01-10 01:13:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:13:51,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:52,125 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:13:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177119834] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:52,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 19 [2025-01-10 01:13:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607001566] [2025-01-10 01:13:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:52,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:13:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:52,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:13:52,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:13:52,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:52,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 92 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 39.5) internal successors, (316), 8 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:52,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:52,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:52,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:53,018 INFO L124 PetriNetUnfolderBase]: 5199/7916 cut-off events. [2025-01-10 01:13:53,019 INFO L125 PetriNetUnfolderBase]: For 8794/9577 co-relation queries the response was YES. [2025-01-10 01:13:53,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21526 conditions, 7916 events. 5199/7916 cut-off events. For 8794/9577 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 47558 event pairs, 1867 based on Foata normal form. 280/6725 useless extension candidates. Maximal degree in co-relation 20495. Up to 3271 conditions per place. [2025-01-10 01:13:53,063 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 95 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2025-01-10 01:13:53,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 128 transitions, 914 flow [2025-01-10 01:13:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 423 transitions. [2025-01-10 01:13:53,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5280898876404494 [2025-01-10 01:13:53,064 INFO L175 Difference]: Start difference. First operand has 119 places, 92 transitions, 567 flow. Second operand 9 states and 423 transitions. [2025-01-10 01:13:53,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 128 transitions, 914 flow [2025-01-10 01:13:53,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 893 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:53,079 INFO L231 Difference]: Finished difference. Result has 126 places, 95 transitions, 611 flow [2025-01-10 01:13:53,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=611, PETRI_PLACES=126, PETRI_TRANSITIONS=95} [2025-01-10 01:13:53,079 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 40 predicate places. [2025-01-10 01:13:53,079 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 95 transitions, 611 flow [2025-01-10 01:13:53,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.5) internal successors, (316), 8 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:53,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:53,080 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:53,085 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:13:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:53,280 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1737266776, now seen corresponding path program 1 times [2025-01-10 01:13:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519516566] [2025-01-10 01:13:53,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:53,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:53,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:53,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:53,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:53,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519516566] [2025-01-10 01:13:53,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519516566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149089434] [2025-01-10 01:13:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:53,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:53,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:53,427 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:13:53,429 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:13:53,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:53,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:53,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:53,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:53,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:13:53,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:53,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:53,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:13:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:53,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149089434] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:53,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:53,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 01:13:53,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460456853] [2025-01-10 01:13:53,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:53,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:13:53,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:53,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:13:53,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:54,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:54,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 95 transitions, 611 flow. Second operand has 17 states, 17 states have (on average 39.8235294117647) internal successors, (677), 17 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:54,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:54,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:54,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:54,791 INFO L124 PetriNetUnfolderBase]: 4708/7372 cut-off events. [2025-01-10 01:13:54,792 INFO L125 PetriNetUnfolderBase]: For 9990/10594 co-relation queries the response was YES. [2025-01-10 01:13:54,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21841 conditions, 7372 events. 4708/7372 cut-off events. For 9990/10594 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 45579 event pairs, 1987 based on Foata normal form. 264/6576 useless extension candidates. Maximal degree in co-relation 20834. Up to 3872 conditions per place. [2025-01-10 01:13:54,840 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 110 selfloop transitions, 21 changer transitions 0/148 dead transitions. [2025-01-10 01:13:54,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 1069 flow [2025-01-10 01:13:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 414 transitions. [2025-01-10 01:13:54,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5814606741573034 [2025-01-10 01:13:54,841 INFO L175 Difference]: Start difference. First operand has 126 places, 95 transitions, 611 flow. Second operand 8 states and 414 transitions. [2025-01-10 01:13:54,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 1069 flow [2025-01-10 01:13:54,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 148 transitions, 1046 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:54,857 INFO L231 Difference]: Finished difference. Result has 127 places, 94 transitions, 626 flow [2025-01-10 01:13:54,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=626, PETRI_PLACES=127, PETRI_TRANSITIONS=94} [2025-01-10 01:13:54,857 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 41 predicate places. [2025-01-10 01:13:54,857 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 94 transitions, 626 flow [2025-01-10 01:13:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 39.8235294117647) internal successors, (677), 17 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:54,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:54,858 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:54,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:13:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:55,058 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:55,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 559553065, now seen corresponding path program 1 times [2025-01-10 01:13:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369830163] [2025-01-10 01:13:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:55,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:13:55,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:13:55,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:55,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:55,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:55,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369830163] [2025-01-10 01:13:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369830163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:55,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952122266] [2025-01-10 01:13:55,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:55,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:55,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:55,160 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:13:55,162 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:13:55,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:13:55,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:13:55,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:55,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:55,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:13:55,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:55,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952122266] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:55,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:55,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:13:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72917848] [2025-01-10 01:13:55,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:55,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:13:55,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:55,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:13:55,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:55,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:55,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 94 transitions, 626 flow. Second operand has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:55,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:55,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:55,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:56,609 INFO L124 PetriNetUnfolderBase]: 8675/12829 cut-off events. [2025-01-10 01:13:56,609 INFO L125 PetriNetUnfolderBase]: For 21213/21793 co-relation queries the response was YES. [2025-01-10 01:13:56,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39286 conditions, 12829 events. 8675/12829 cut-off events. For 21213/21793 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 76925 event pairs, 4697 based on Foata normal form. 223/11293 useless extension candidates. Maximal degree in co-relation 24089. Up to 7126 conditions per place. [2025-01-10 01:13:56,683 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 142 selfloop transitions, 44 changer transitions 0/201 dead transitions. [2025-01-10 01:13:56,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 201 transitions, 1625 flow [2025-01-10 01:13:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:13:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:13:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 584 transitions. [2025-01-10 01:13:56,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5468164794007491 [2025-01-10 01:13:56,685 INFO L175 Difference]: Start difference. First operand has 127 places, 94 transitions, 626 flow. Second operand 12 states and 584 transitions. [2025-01-10 01:13:56,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 201 transitions, 1625 flow [2025-01-10 01:13:56,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 201 transitions, 1554 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:56,714 INFO L231 Difference]: Finished difference. Result has 136 places, 118 transitions, 942 flow [2025-01-10 01:13:56,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=942, PETRI_PLACES=136, PETRI_TRANSITIONS=118} [2025-01-10 01:13:56,714 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 50 predicate places. [2025-01-10 01:13:56,714 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 118 transitions, 942 flow [2025-01-10 01:13:56,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:56,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:56,715 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:56,721 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:13:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:56,915 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:56,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1554288264, now seen corresponding path program 2 times [2025-01-10 01:13:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:56,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871561608] [2025-01-10 01:13:56,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:56,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 01:13:56,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 30 statements. [2025-01-10 01:13:56,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:56,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871561608] [2025-01-10 01:13:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871561608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:56,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:56,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:13:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035487727] [2025-01-10 01:13:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:56,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:56,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:56,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:56,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-01-10 01:13:56,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 118 transitions, 942 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:56,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:56,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-01-10 01:13:56,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:58,052 INFO L124 PetriNetUnfolderBase]: 10622/15204 cut-off events. [2025-01-10 01:13:58,053 INFO L125 PetriNetUnfolderBase]: For 29510/31006 co-relation queries the response was YES. [2025-01-10 01:13:58,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47105 conditions, 15204 events. 10622/15204 cut-off events. For 29510/31006 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 87476 event pairs, 1536 based on Foata normal form. 724/13871 useless extension candidates. Maximal degree in co-relation 28781. Up to 8891 conditions per place. [2025-01-10 01:13:58,154 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 182 selfloop transitions, 15 changer transitions 0/210 dead transitions. [2025-01-10 01:13:58,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 210 transitions, 1836 flow [2025-01-10 01:13:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 321 transitions. [2025-01-10 01:13:58,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.601123595505618 [2025-01-10 01:13:58,155 INFO L175 Difference]: Start difference. First operand has 136 places, 118 transitions, 942 flow. Second operand 6 states and 321 transitions. [2025-01-10 01:13:58,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 210 transitions, 1836 flow [2025-01-10 01:13:58,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 210 transitions, 1819 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:58,220 INFO L231 Difference]: Finished difference. Result has 145 places, 125 transitions, 1019 flow [2025-01-10 01:13:58,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1019, PETRI_PLACES=145, PETRI_TRANSITIONS=125} [2025-01-10 01:13:58,221 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 59 predicate places. [2025-01-10 01:13:58,221 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 125 transitions, 1019 flow [2025-01-10 01:13:58,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:58,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:58,221 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:58,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:13:58,221 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:58,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1264797045, now seen corresponding path program 1 times [2025-01-10 01:13:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968489748] [2025-01-10 01:13:58,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:58,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:13:58,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:13:58,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:58,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:58,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968489748] [2025-01-10 01:13:58,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968489748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713137721] [2025-01-10 01:13:58,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:58,324 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:13:58,325 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:13:58,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:13:58,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:13:58,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:58,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:58,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:13:58,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:58,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713137721] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:58,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:13:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973096259] [2025-01-10 01:13:58,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:13:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:58,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:13:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:58,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:58,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 125 transitions, 1019 flow. Second operand has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:58,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:58,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:58,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:59,810 INFO L124 PetriNetUnfolderBase]: 7292/11762 cut-off events. [2025-01-10 01:13:59,810 INFO L125 PetriNetUnfolderBase]: For 25031/25906 co-relation queries the response was YES. [2025-01-10 01:13:59,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38189 conditions, 11762 events. 7292/11762 cut-off events. For 25031/25906 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 76567 event pairs, 4404 based on Foata normal form. 322/10689 useless extension candidates. Maximal degree in co-relation 27047. Up to 7013 conditions per place. [2025-01-10 01:13:59,900 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 139 selfloop transitions, 46 changer transitions 0/204 dead transitions. [2025-01-10 01:13:59,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 204 transitions, 1824 flow [2025-01-10 01:13:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:13:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:13:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 576 transitions. [2025-01-10 01:13:59,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5393258426966292 [2025-01-10 01:13:59,901 INFO L175 Difference]: Start difference. First operand has 145 places, 125 transitions, 1019 flow. Second operand 12 states and 576 transitions. [2025-01-10 01:13:59,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 204 transitions, 1824 flow [2025-01-10 01:13:59,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 204 transitions, 1816 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-10 01:13:59,951 INFO L231 Difference]: Finished difference. Result has 159 places, 129 transitions, 1172 flow [2025-01-10 01:13:59,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1172, PETRI_PLACES=159, PETRI_TRANSITIONS=129} [2025-01-10 01:13:59,952 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 73 predicate places. [2025-01-10 01:13:59,952 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 129 transitions, 1172 flow [2025-01-10 01:13:59,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:59,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:59,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:59,958 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:00,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:14:00,153 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:00,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1545909337, now seen corresponding path program 1 times [2025-01-10 01:14:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313489989] [2025-01-10 01:14:00,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:00,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:14:00,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:14:00,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:00,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:00,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:00,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313489989] [2025-01-10 01:14:00,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313489989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:00,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:00,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:00,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384471432] [2025-01-10 01:14:00,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:00,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:00,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:00,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:00,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:00,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:14:00,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 129 transitions, 1172 flow. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 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:00,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:00,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:14:00,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:01,673 INFO L124 PetriNetUnfolderBase]: 10706/16983 cut-off events. [2025-01-10 01:14:01,673 INFO L125 PetriNetUnfolderBase]: For 42887/44850 co-relation queries the response was YES. [2025-01-10 01:14:01,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57055 conditions, 16983 events. 10706/16983 cut-off events. For 42887/44850 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 117779 event pairs, 1862 based on Foata normal form. 806/15670 useless extension candidates. Maximal degree in co-relation 39426. Up to 7497 conditions per place. [2025-01-10 01:14:01,823 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 166 selfloop transitions, 17 changer transitions 21/224 dead transitions. [2025-01-10 01:14:01,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 224 transitions, 2154 flow [2025-01-10 01:14:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 368 transitions. [2025-01-10 01:14:01,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906902086677368 [2025-01-10 01:14:01,824 INFO L175 Difference]: Start difference. First operand has 159 places, 129 transitions, 1172 flow. Second operand 7 states and 368 transitions. [2025-01-10 01:14:01,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 224 transitions, 2154 flow [2025-01-10 01:14:01,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 224 transitions, 2069 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-01-10 01:14:01,927 INFO L231 Difference]: Finished difference. Result has 159 places, 122 transitions, 972 flow [2025-01-10 01:14:01,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=972, PETRI_PLACES=159, PETRI_TRANSITIONS=122} [2025-01-10 01:14:01,928 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 73 predicate places. [2025-01-10 01:14:01,928 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 122 transitions, 972 flow [2025-01-10 01:14:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 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:01,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:01,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:14:01,928 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:01,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 799884765, now seen corresponding path program 1 times [2025-01-10 01:14:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638767002] [2025-01-10 01:14:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:01,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:14:01,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:14:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:01,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:14:02,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638767002] [2025-01-10 01:14:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638767002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:02,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887842193] [2025-01-10 01:14:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:02,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:02,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:02,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:14:02,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 122 transitions, 972 flow. Second operand has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:02,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:02,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:14:02,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:04,186 INFO L124 PetriNetUnfolderBase]: 15454/24887 cut-off events. [2025-01-10 01:14:04,186 INFO L125 PetriNetUnfolderBase]: For 58592/60796 co-relation queries the response was YES. [2025-01-10 01:14:04,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87329 conditions, 24887 events. 15454/24887 cut-off events. For 58592/60796 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 191203 event pairs, 5103 based on Foata normal form. 1063/23465 useless extension candidates. Maximal degree in co-relation 64425. Up to 11841 conditions per place. [2025-01-10 01:14:04,412 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 198 selfloop transitions, 28 changer transitions 0/247 dead transitions. [2025-01-10 01:14:04,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 247 transitions, 2218 flow [2025-01-10 01:14:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 418 transitions. [2025-01-10 01:14:04,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5870786516853933 [2025-01-10 01:14:04,413 INFO L175 Difference]: Start difference. First operand has 159 places, 122 transitions, 972 flow. Second operand 8 states and 418 transitions. [2025-01-10 01:14:04,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 247 transitions, 2218 flow [2025-01-10 01:14:04,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 247 transitions, 2002 flow, removed 28 selfloop flow, removed 22 redundant places. [2025-01-10 01:14:04,771 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1096 flow [2025-01-10 01:14:04,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1096, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2025-01-10 01:14:04,771 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 52 predicate places. [2025-01-10 01:14:04,772 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1096 flow [2025-01-10 01:14:04,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:04,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:04,772 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:04,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:14:04,772 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:04,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash 744473505, now seen corresponding path program 2 times [2025-01-10 01:14:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507534270] [2025-01-10 01:14:04,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:04,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:14:04,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 33 statements. [2025-01-10 01:14:04,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:04,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:14:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507534270] [2025-01-10 01:14:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507534270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:04,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:04,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440362155] [2025-01-10 01:14:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:04,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:04,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:04,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:14:04,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1096 flow. Second operand has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:04,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:04,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:14:04,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:07,849 INFO L124 PetriNetUnfolderBase]: 18138/27939 cut-off events. [2025-01-10 01:14:07,849 INFO L125 PetriNetUnfolderBase]: For 67273/69480 co-relation queries the response was YES. [2025-01-10 01:14:07,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102524 conditions, 27939 events. 18138/27939 cut-off events. For 67273/69480 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 206345 event pairs, 1432 based on Foata normal form. 1387/26324 useless extension candidates. Maximal degree in co-relation 75755. Up to 13171 conditions per place. [2025-01-10 01:14:08,090 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 210 selfloop transitions, 38 changer transitions 0/269 dead transitions. [2025-01-10 01:14:08,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 269 transitions, 2320 flow [2025-01-10 01:14:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:14:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:14:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 471 transitions. [2025-01-10 01:14:08,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5880149812734082 [2025-01-10 01:14:08,091 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1096 flow. Second operand 9 states and 471 transitions. [2025-01-10 01:14:08,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 269 transitions, 2320 flow [2025-01-10 01:14:08,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 269 transitions, 2288 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:08,610 INFO L231 Difference]: Finished difference. Result has 145 places, 145 transitions, 1208 flow [2025-01-10 01:14:08,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1208, PETRI_PLACES=145, PETRI_TRANSITIONS=145} [2025-01-10 01:14:08,610 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 59 predicate places. [2025-01-10 01:14:08,610 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 145 transitions, 1208 flow [2025-01-10 01:14:08,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:08,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:08,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:14:08,611 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1617134075, now seen corresponding path program 3 times [2025-01-10 01:14:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89951201] [2025-01-10 01:14:08,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:08,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-01-10 01:14:08,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 33 statements. [2025-01-10 01:14:08,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:08,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:14:08,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:08,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89951201] [2025-01-10 01:14:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89951201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:08,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:14:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379427076] [2025-01-10 01:14:08,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:08,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:08,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:08,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:08,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:14:08,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 145 transitions, 1208 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call 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:08,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:08,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:14:08,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:11,469 INFO L124 PetriNetUnfolderBase]: 18822/29598 cut-off events. [2025-01-10 01:14:11,469 INFO L125 PetriNetUnfolderBase]: For 88739/91402 co-relation queries the response was YES. [2025-01-10 01:14:11,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110129 conditions, 29598 events. 18822/29598 cut-off events. For 88739/91402 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 225405 event pairs, 4078 based on Foata normal form. 1543/28025 useless extension candidates. Maximal degree in co-relation 86845. Up to 8766 conditions per place. [2025-01-10 01:14:11,774 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 241 selfloop transitions, 29 changer transitions 0/291 dead transitions. [2025-01-10 01:14:11,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 291 transitions, 2658 flow [2025-01-10 01:14:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 398 transitions. [2025-01-10 01:14:11,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388443017656501 [2025-01-10 01:14:11,775 INFO L175 Difference]: Start difference. First operand has 145 places, 145 transitions, 1208 flow. Second operand 7 states and 398 transitions. [2025-01-10 01:14:11,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 291 transitions, 2658 flow [2025-01-10 01:14:12,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 291 transitions, 2517 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-01-10 01:14:12,487 INFO L231 Difference]: Finished difference. Result has 149 places, 156 transitions, 1349 flow [2025-01-10 01:14:12,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1349, PETRI_PLACES=149, PETRI_TRANSITIONS=156} [2025-01-10 01:14:12,487 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 63 predicate places. [2025-01-10 01:14:12,487 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 156 transitions, 1349 flow [2025-01-10 01:14:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call 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:12,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:12,487 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:14:12,488 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1354411874, now seen corresponding path program 2 times [2025-01-10 01:14:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238959483] [2025-01-10 01:14:12,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:12,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:14:12,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:12,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:12,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:14:12,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:12,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238959483] [2025-01-10 01:14:12,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238959483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50106363] [2025-01-10 01:14:12,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:12,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:12,730 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:12,731 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:12,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:14:12,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:12,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:12,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:12,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:14:12,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:14:12,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:13,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:14:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:14:13,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50106363] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:13,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:13,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-01-10 01:14:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196345463] [2025-01-10 01:14:13,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:13,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:14:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:13,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:14:13,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:14:14,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:14:14,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 156 transitions, 1349 flow. Second operand has 23 states, 23 states have (on average 38.78260869565217) internal successors, (892), 23 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call 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:14,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:14,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:14:14,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:19,307 INFO L124 PetriNetUnfolderBase]: 32735/48511 cut-off events. [2025-01-10 01:14:19,307 INFO L125 PetriNetUnfolderBase]: For 161990/165629 co-relation queries the response was YES. [2025-01-10 01:14:19,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184427 conditions, 48511 events. 32735/48511 cut-off events. For 161990/165629 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 357737 event pairs, 9637 based on Foata normal form. 2317/45237 useless extension candidates. Maximal degree in co-relation 152413. Up to 15880 conditions per place. [2025-01-10 01:14:19,818 INFO L140 encePairwiseOnDemand]: 74/89 looper letters, 279 selfloop transitions, 71 changer transitions 0/369 dead transitions. [2025-01-10 01:14:19,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 369 transitions, 3671 flow [2025-01-10 01:14:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:14:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:14:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 777 transitions. [2025-01-10 01:14:19,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5456460674157303 [2025-01-10 01:14:19,819 INFO L175 Difference]: Start difference. First operand has 149 places, 156 transitions, 1349 flow. Second operand 16 states and 777 transitions. [2025-01-10 01:14:19,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 369 transitions, 3671 flow [2025-01-10 01:14:21,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 369 transitions, 3587 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-01-10 01:14:21,997 INFO L231 Difference]: Finished difference. Result has 171 places, 188 transitions, 1984 flow [2025-01-10 01:14:21,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1984, PETRI_PLACES=171, PETRI_TRANSITIONS=188} [2025-01-10 01:14:21,998 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 85 predicate places. [2025-01-10 01:14:21,998 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 188 transitions, 1984 flow [2025-01-10 01:14:21,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 38.78260869565217) internal successors, (892), 23 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call 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,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:21,998 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:22,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:14:22,198 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:22,199 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:22,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1354411872, now seen corresponding path program 1 times [2025-01-10 01:14:22,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:22,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854316712] [2025-01-10 01:14:22,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:22,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:22,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:22,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:22,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:14:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854316712] [2025-01-10 01:14:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854316712] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368242841] [2025-01-10 01:14:22,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:22,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:22,701 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:22,702 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:22,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:22,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:14:22,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:22,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:14:22,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:14:22,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:14:22,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:22,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:14:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:14:22,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:23,090 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 33 treesize of output 29 [2025-01-10 01:14:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:14:23,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368242841] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:23,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:23,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2025-01-10 01:14:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273780450] [2025-01-10 01:14:23,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:23,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:14:23,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:23,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:14:23,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:14:24,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 89 [2025-01-10 01:14:24,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 188 transitions, 1984 flow. Second operand has 28 states, 28 states have (on average 34.57142857142857) internal successors, (968), 28 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:24,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 89 [2025-01-10 01:14:24,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:30,781 INFO L124 PetriNetUnfolderBase]: 31065/49476 cut-off events. [2025-01-10 01:14:30,782 INFO L125 PetriNetUnfolderBase]: For 233803/238782 co-relation queries the response was YES. [2025-01-10 01:14:31,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205370 conditions, 49476 events. 31065/49476 cut-off events. For 233803/238782 co-relation queries the response was YES. Maximal size of possible extension queue 1531. Compared 405157 event pairs, 8446 based on Foata normal form. 3391/48803 useless extension candidates. Maximal degree in co-relation 159840. Up to 11177 conditions per place. [2025-01-10 01:14:31,483 INFO L140 encePairwiseOnDemand]: 74/89 looper letters, 378 selfloop transitions, 102 changer transitions 3/504 dead transitions. [2025-01-10 01:14:31,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 504 transitions, 5486 flow [2025-01-10 01:14:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 01:14:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 01:14:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1093 transitions. [2025-01-10 01:14:31,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47234226447709593 [2025-01-10 01:14:31,485 INFO L175 Difference]: Start difference. First operand has 171 places, 188 transitions, 1984 flow. Second operand 26 states and 1093 transitions. [2025-01-10 01:14:31,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 504 transitions, 5486 flow [2025-01-10 01:14:35,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 504 transitions, 5440 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:35,696 INFO L231 Difference]: Finished difference. Result has 198 places, 222 transitions, 2827 flow [2025-01-10 01:14:35,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2827, PETRI_PLACES=198, PETRI_TRANSITIONS=222} [2025-01-10 01:14:35,697 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 112 predicate places. [2025-01-10 01:14:35,697 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 222 transitions, 2827 flow [2025-01-10 01:14:35,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 34.57142857142857) internal successors, (968), 28 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:35,697 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:35,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 01:14:35,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:35,898 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:35,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1354411870, now seen corresponding path program 1 times [2025-01-10 01:14:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741508310] [2025-01-10 01:14:35,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:35,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:35,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:35,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:35,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:14:36,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:36,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741508310] [2025-01-10 01:14:36,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741508310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:36,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242792221] [2025-01-10 01:14:36,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:36,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:36,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:36,230 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:14:36,230 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:14:36,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:36,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:36,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:36,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:36,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-10 01:14:36,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:36,320 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:36,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:14:36,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:14:36,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 01:14:36,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:14:36,458 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-01-10 01:14:36,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2025-01-10 01:14:36,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:36,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:14:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:14:37,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:37,352 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 10 treesize of output 8 [2025-01-10 01:14:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:14:37,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242792221] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:37,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:37,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 31 [2025-01-10 01:14:37,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346524370] [2025-01-10 01:14:37,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:37,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 01:14:37,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:37,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 01:14:37,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 01:14:39,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 89 [2025-01-10 01:14:39,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 222 transitions, 2827 flow. Second operand has 33 states, 33 states have (on average 29.515151515151516) internal successors, (974), 33 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call 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,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:39,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 89 [2025-01-10 01:14:39,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:46,014 INFO L124 PetriNetUnfolderBase]: 32452/51753 cut-off events. [2025-01-10 01:14:46,014 INFO L125 PetriNetUnfolderBase]: For 294398/299529 co-relation queries the response was YES. [2025-01-10 01:14:46,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224626 conditions, 51753 events. 32452/51753 cut-off events. For 294398/299529 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 416353 event pairs, 7019 based on Foata normal form. 3516/51503 useless extension candidates. Maximal degree in co-relation 200542. Up to 10723 conditions per place. [2025-01-10 01:14:46,600 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 298 selfloop transitions, 85 changer transitions 0/402 dead transitions. [2025-01-10 01:14:46,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 402 transitions, 4731 flow [2025-01-10 01:14:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:14:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:14:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 675 transitions. [2025-01-10 01:14:46,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42134831460674155 [2025-01-10 01:14:46,602 INFO L175 Difference]: Start difference. First operand has 198 places, 222 transitions, 2827 flow. Second operand 18 states and 675 transitions. [2025-01-10 01:14:46,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 402 transitions, 4731 flow