./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i --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/goblint-regression/09-regions_11-arraylist_nr-deref.i -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 c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:27,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:27,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:55:27,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:27,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:27,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:27,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:27,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:27,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:27,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:27,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:27,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:27,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:27,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:27,988 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:27,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:27,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:27,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:27,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:27,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:27,989 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:27,989 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:27,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:27,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:27,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:27,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:27,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:27,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:27,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:27,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:27,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:27,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:27,993 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 -> c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 [2025-01-10 00:55:28,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:28,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:28,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:28,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:28,283 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:28,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2025-01-10 00:55:29,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f158073a/689c7f0cb3c440fd8cf5222281ac3a66/FLAGef1c58ec2 [2025-01-10 00:55:29,919 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:29,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2025-01-10 00:55:29,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f158073a/689c7f0cb3c440fd8cf5222281ac3a66/FLAGef1c58ec2 [2025-01-10 00:55:29,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f158073a/689c7f0cb3c440fd8cf5222281ac3a66 [2025-01-10 00:55:29,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:29,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:29,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:29,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:29,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:29,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9cecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29, skipping insertion in model container [2025-01-10 00:55:29,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:30,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:30,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:30,461 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:30,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:30,601 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:30,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30 WrapperNode [2025-01-10 00:55:30,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:30,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:30,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:30,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:30,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,664 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 176 [2025-01-10 00:55:30,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:30,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:30,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:30,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:30,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,700 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-01-10 00:55:30,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:30,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:30,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:30,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:30,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:30,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:30,773 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 00:55:30,778 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 00:55:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:55:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:30,803 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:30,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:30,806 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 00:55:30,961 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:30,964 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:31,407 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:31,408 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:31,776 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:31,776 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:31,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:31 BoogieIcfgContainer [2025-01-10 00:55:31,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:31,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:31,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:31,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:31,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:29" (1/3) ... [2025-01-10 00:55:31,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b040d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:31, skipping insertion in model container [2025-01-10 00:55:31,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30" (2/3) ... [2025-01-10 00:55:31,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b040d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:31, skipping insertion in model container [2025-01-10 00:55:31,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:31" (3/3) ... [2025-01-10 00:55:31,788 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr-deref.i [2025-01-10 00:55:31,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:31,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr-deref.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 37 error locations. [2025-01-10 00:55:31,803 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:31,903 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:31,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2025-01-10 00:55:31,974 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-01-10 00:55:31,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:31,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-01-10 00:55:31,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2025-01-10 00:55:31,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2025-01-10 00:55:31,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:32,004 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;@6499dabf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:32,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 00:55:32,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:32,010 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 00:55:32,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:32,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:32,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:55:32,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 490872, now seen corresponding path program 1 times [2025-01-10 00:55:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672752320] [2025-01-10 00:55:32,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:32,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:55:32,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:55:32,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:32,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:32,338 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 00:55:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672752320] [2025-01-10 00:55:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672752320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:32,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404074485] [2025-01-10 00:55:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:32,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:32,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:32,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:32,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-01-10 00:55:32,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:32,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:32,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-01-10 00:55:32,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:32,534 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2025-01-10 00:55:32,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:32,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 267 events. 64/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1236 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 153 conditions per place. [2025-01-10 00:55:32,541 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-01-10 00:55:32,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 199 flow [2025-01-10 00:55:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-01-10 00:55:32,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7652582159624414 [2025-01-10 00:55:32,560 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 163 transitions. [2025-01-10 00:55:32,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 199 flow [2025-01-10 00:55:32,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:32,572 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 154 flow [2025-01-10 00:55:32,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-01-10 00:55:32,578 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-01-10 00:55:32,578 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 154 flow [2025-01-10 00:55:32,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:32,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:32,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:55:32,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:32,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:32,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 15215314, now seen corresponding path program 1 times [2025-01-10 00:55:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:32,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762393351] [2025-01-10 00:55:32,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:32,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:55:32,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:55:32,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:32,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:32,718 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 00:55:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762393351] [2025-01-10 00:55:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762393351] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:32,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313476960] [2025-01-10 00:55:32,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:32,721 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 00:55:32,723 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 00:55:32,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:55:32,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:55:32,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:32,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:32,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:55:32,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:32,878 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 00:55:32,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:32,898 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 00:55:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313476960] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:32,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:32,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:55:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453396621] [2025-01-10 00:55:32,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:32,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:32,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:32,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:32,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-01-10 00:55:32,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:32,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:32,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-01-10 00:55:32,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,072 INFO L124 PetriNetUnfolderBase]: 64/270 cut-off events. [2025-01-10 00:55:33,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:33,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 270 events. 64/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1236 event pairs, 63 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 429. Up to 153 conditions per place. [2025-01-10 00:55:33,076 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2025-01-10 00:55:33,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 226 flow [2025-01-10 00:55:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-01-10 00:55:33,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2025-01-10 00:55:33,078 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 6 states and 303 transitions. [2025-01-10 00:55:33,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 226 flow [2025-01-10 00:55:33,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:33,083 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 186 flow [2025-01-10 00:55:33,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-01-10 00:55:33,084 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2025-01-10 00:55:33,084 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 186 flow [2025-01-10 00:55:33,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:33,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,085 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-01-10 00:55:33,093 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 00:55:33,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:33,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1988819976, now seen corresponding path program 2 times [2025-01-10 00:55:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831627104] [2025-01-10 00:55:33,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 00:55:33,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-01-10 00:55:33,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:55:33,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:55:33,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831627104] [2025-01-10 00:55:33,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831627104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:33,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194786956] [2025-01-10 00:55:33,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:33,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:33,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:33,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-01-10 00:55:33,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:33,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-01-10 00:55:33,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,551 INFO L124 PetriNetUnfolderBase]: 64/266 cut-off events. [2025-01-10 00:55:33,551 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:33,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 266 events. 64/266 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1209 event pairs, 63 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 418. Up to 155 conditions per place. [2025-01-10 00:55:33,553 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 28 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-01-10 00:55:33,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 242 flow [2025-01-10 00:55:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-01-10 00:55:33,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2025-01-10 00:55:33,555 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 186 flow. Second operand 3 states and 149 transitions. [2025-01-10 00:55:33,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 242 flow [2025-01-10 00:55:33,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 70 transitions, 228 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:33,558 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 172 flow [2025-01-10 00:55:33,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2025-01-10 00:55:33,559 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-01-10 00:55:33,559 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 172 flow [2025-01-10 00:55:33,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:33,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,560 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-01-10 00:55:33,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:33,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1988819975, now seen corresponding path program 1 times [2025-01-10 00:55:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921813652] [2025-01-10 00:55:33,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:55:33,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:55:33,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:33,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921813652] [2025-01-10 00:55:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921813652] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868384479] [2025-01-10 00:55:33,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:33,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:33,701 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 00:55:33,703 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 00:55:33,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:55:33,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:55:33,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:55:33,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:33,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:33,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868384479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:33,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:33,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:55:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441186575] [2025-01-10 00:55:33,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:33,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:33,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-01-10 00:55:33,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:33,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-01-10 00:55:33,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,103 INFO L124 PetriNetUnfolderBase]: 64/272 cut-off events. [2025-01-10 00:55:34,103 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 00:55:34,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 272 events. 64/272 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1212 event pairs, 63 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 420. Up to 153 conditions per place. [2025-01-10 00:55:34,108 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2025-01-10 00:55:34,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 280 flow [2025-01-10 00:55:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:55:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:55:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2025-01-10 00:55:34,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830985915492958 [2025-01-10 00:55:34,113 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 172 flow. Second operand 12 states and 582 transitions. [2025-01-10 00:55:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 280 flow [2025-01-10 00:55:34,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:34,118 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 248 flow [2025-01-10 00:55:34,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2025-01-10 00:55:34,119 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2025-01-10 00:55:34,119 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 248 flow [2025-01-10 00:55:34,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:34,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,120 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-01-10 00:55:34,129 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 00:55:34,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:34,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:34,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash -99502663, now seen corresponding path program 2 times [2025-01-10 00:55:34,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691177952] [2025-01-10 00:55:34,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:34,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 00:55:34,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-01-10 00:55:34,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:55:34,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:34,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691177952] [2025-01-10 00:55:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691177952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057332812] [2025-01-10 00:55:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:34,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:34,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2025-01-10 00:55:34,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:34,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2025-01-10 00:55:34,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,548 INFO L124 PetriNetUnfolderBase]: 64/268 cut-off events. [2025-01-10 00:55:34,548 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 00:55:34,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 268 events. 64/268 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1195 event pairs, 63 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 418. Up to 161 conditions per place. [2025-01-10 00:55:34,550 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 32 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-01-10 00:55:34,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 312 flow [2025-01-10 00:55:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-01-10 00:55:34,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2025-01-10 00:55:34,552 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 248 flow. Second operand 3 states and 153 transitions. [2025-01-10 00:55:34,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 312 flow [2025-01-10 00:55:34,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 72 transitions, 264 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:55:34,556 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 200 flow [2025-01-10 00:55:34,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-01-10 00:55:34,557 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2025-01-10 00:55:34,557 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 200 flow [2025-01-10 00:55:34,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:34,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,558 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-01-10 00:55:34,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:34,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1132765287, now seen corresponding path program 1 times [2025-01-10 00:55:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166830294] [2025-01-10 00:55:34,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:34,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:34,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166830294] [2025-01-10 00:55:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166830294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243114387] [2025-01-10 00:55:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:34,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:34,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:34,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-01-10 00:55:34,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:34,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-01-10 00:55:34,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:35,084 INFO L124 PetriNetUnfolderBase]: 73/286 cut-off events. [2025-01-10 00:55:35,085 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 00:55:35,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 286 events. 73/286 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1288 event pairs, 72 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 461. Up to 183 conditions per place. [2025-01-10 00:55:35,087 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2025-01-10 00:55:35,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 68 transitions, 270 flow [2025-01-10 00:55:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-01-10 00:55:35,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2025-01-10 00:55:35,089 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 200 flow. Second operand 3 states and 147 transitions. [2025-01-10 00:55:35,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 68 transitions, 270 flow [2025-01-10 00:55:35,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:35,092 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 186 flow [2025-01-10 00:55:35,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-01-10 00:55:35,093 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-01-10 00:55:35,093 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 186 flow [2025-01-10 00:55:35,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:35,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:35,093 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-01-10 00:55:35,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:35,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:35,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1132765286, now seen corresponding path program 1 times [2025-01-10 00:55:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:35,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382697267] [2025-01-10 00:55:35,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:35,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:35,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:35,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:35,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:35,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:35,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382697267] [2025-01-10 00:55:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382697267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:35,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792799062] [2025-01-10 00:55:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:35,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:35,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:35,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:35,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 71 [2025-01-10 00:55:35,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:35,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:35,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 71 [2025-01-10 00:55:35,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:35,738 INFO L124 PetriNetUnfolderBase]: 73/281 cut-off events. [2025-01-10 00:55:35,738 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 00:55:35,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 281 events. 73/281 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1258 event pairs, 63 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 484. Up to 148 conditions per place. [2025-01-10 00:55:35,739 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 6 changer transitions 3/74 dead transitions. [2025-01-10 00:55:35,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 290 flow [2025-01-10 00:55:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-01-10 00:55:35,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309859154929578 [2025-01-10 00:55:35,741 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 186 flow. Second operand 5 states and 224 transitions. [2025-01-10 00:55:35,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 290 flow [2025-01-10 00:55:35,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:35,743 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 191 flow [2025-01-10 00:55:35,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2025-01-10 00:55:35,744 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-01-10 00:55:35,744 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 191 flow [2025-01-10 00:55:35,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:35,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:35,745 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:35,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:35,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:35,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1259591612, now seen corresponding path program 1 times [2025-01-10 00:55:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:35,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524415027] [2025-01-10 00:55:35,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:35,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:55:35,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:55:35,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:35,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524415027] [2025-01-10 00:55:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524415027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702884856] [2025-01-10 00:55:36,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:36,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:36,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:36,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:36,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2025-01-10 00:55:36,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:36,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:36,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2025-01-10 00:55:36,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:36,510 INFO L124 PetriNetUnfolderBase]: 64/252 cut-off events. [2025-01-10 00:55:36,511 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 00:55:36,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 252 events. 64/252 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1107 event pairs, 54 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 453. Up to 126 conditions per place. [2025-01-10 00:55:36,512 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2025-01-10 00:55:36,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 301 flow [2025-01-10 00:55:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2025-01-10 00:55:36,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875251509054326 [2025-01-10 00:55:36,514 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 191 flow. Second operand 7 states and 292 transitions. [2025-01-10 00:55:36,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 301 flow [2025-01-10 00:55:36,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:36,519 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 189 flow [2025-01-10 00:55:36,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2025-01-10 00:55:36,519 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-01-10 00:55:36,521 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 189 flow [2025-01-10 00:55:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:36,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:36,521 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:36,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:36,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:36,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1259591613, now seen corresponding path program 1 times [2025-01-10 00:55:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:36,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506200799] [2025-01-10 00:55:36,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:36,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:55:36,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:55:36,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:36,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:36,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506200799] [2025-01-10 00:55:36,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506200799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:36,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276185560] [2025-01-10 00:55:36,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:36,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:36,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:36,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:36,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:37,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2025-01-10 00:55:37,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:37,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:37,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2025-01-10 00:55:37,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,501 INFO L124 PetriNetUnfolderBase]: 64/250 cut-off events. [2025-01-10 00:55:37,502 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 00:55:37,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 250 events. 64/250 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1103 event pairs, 54 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 452. Up to 126 conditions per place. [2025-01-10 00:55:37,504 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 7 changer transitions 3/70 dead transitions. [2025-01-10 00:55:37,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 297 flow [2025-01-10 00:55:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 270 transitions. [2025-01-10 00:55:37,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432595573440644 [2025-01-10 00:55:37,508 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 189 flow. Second operand 7 states and 270 transitions. [2025-01-10 00:55:37,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 297 flow [2025-01-10 00:55:37,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:37,511 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 185 flow [2025-01-10 00:55:37,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2025-01-10 00:55:37,512 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2025-01-10 00:55:37,512 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 185 flow [2025-01-10 00:55:37,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:37,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,514 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:37,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:55:37,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:37,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -713220457, now seen corresponding path program 1 times [2025-01-10 00:55:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23978687] [2025-01-10 00:55:37,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:37,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:55:37,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:37,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:37,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:37,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23978687] [2025-01-10 00:55:37,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23978687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:37,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:37,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:37,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291531029] [2025-01-10 00:55:37,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:37,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:37,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:37,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:37,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:37,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-01-10 00:55:37,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:37,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:37,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-01-10 00:55:37,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,887 INFO L124 PetriNetUnfolderBase]: 64/249 cut-off events. [2025-01-10 00:55:37,888 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 00:55:37,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 249 events. 64/249 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1076 event pairs, 63 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 451. Up to 158 conditions per place. [2025-01-10 00:55:37,889 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 32 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-01-10 00:55:37,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 259 flow [2025-01-10 00:55:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-01-10 00:55:37,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2025-01-10 00:55:37,891 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 185 flow. Second operand 5 states and 219 transitions. [2025-01-10 00:55:37,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 259 flow [2025-01-10 00:55:37,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 60 transitions, 245 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:37,893 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 181 flow [2025-01-10 00:55:37,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-01-10 00:55:37,894 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-01-10 00:55:37,895 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 181 flow [2025-01-10 00:55:37,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:37,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,896 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:37,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:55:37,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:37,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash -713220456, now seen corresponding path program 1 times [2025-01-10 00:55:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410122012] [2025-01-10 00:55:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:37,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:55:37,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:37,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-10 00:55:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:38,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410122012] [2025-01-10 00:55:38,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410122012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634814183] [2025-01-10 00:55:38,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:38,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:38,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:38,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-01-10 00:55:38,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:38,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-01-10 00:55:38,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:38,392 INFO L124 PetriNetUnfolderBase]: 64/248 cut-off events. [2025-01-10 00:55:38,392 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 00:55:38,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 248 events. 64/248 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1091 event pairs, 63 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 438. Up to 158 conditions per place. [2025-01-10 00:55:38,393 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-01-10 00:55:38,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 59 transitions, 251 flow [2025-01-10 00:55:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-01-10 00:55:38,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6394366197183099 [2025-01-10 00:55:38,395 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 181 flow. Second operand 5 states and 227 transitions. [2025-01-10 00:55:38,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 59 transitions, 251 flow [2025-01-10 00:55:38,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 59 transitions, 239 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:38,397 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2025-01-10 00:55:38,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-01-10 00:55:38,400 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-01-10 00:55:38,400 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2025-01-10 00:55:38,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:38,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,400 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:38,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:55:38,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1708499431, now seen corresponding path program 1 times [2025-01-10 00:55:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:38,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927927850] [2025-01-10 00:55:38,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:38,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:55:38,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:55:38,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:38,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-10 00:55:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:38,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927927850] [2025-01-10 00:55:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927927850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711565316] [2025-01-10 00:55:38,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:38,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:38,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:38,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:38,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2025-01-10 00:55:38,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:38,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2025-01-10 00:55:38,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:38,636 INFO L124 PetriNetUnfolderBase]: 71/258 cut-off events. [2025-01-10 00:55:38,636 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 00:55:38,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 258 events. 71/258 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1124 event pairs, 56 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 463. Up to 148 conditions per place. [2025-01-10 00:55:38,638 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-10 00:55:38,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 277 flow [2025-01-10 00:55:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 00:55:38,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2025-01-10 00:55:38,640 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 162 transitions. [2025-01-10 00:55:38,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 277 flow [2025-01-10 00:55:38,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 265 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:38,642 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 167 flow [2025-01-10 00:55:38,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-01-10 00:55:38,643 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2025-01-10 00:55:38,644 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 167 flow [2025-01-10 00:55:38,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:38,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,644 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:38,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:55:38,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1708499432, now seen corresponding path program 1 times [2025-01-10 00:55:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849547830] [2025-01-10 00:55:38,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:38,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:55:38,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:55:38,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:38,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 00:55:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849547830] [2025-01-10 00:55:38,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849547830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323171908] [2025-01-10 00:55:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:38,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:38,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:38,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2025-01-10 00:55:38,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:38,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2025-01-10 00:55:38,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:38,903 INFO L124 PetriNetUnfolderBase]: 64/235 cut-off events. [2025-01-10 00:55:38,904 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-01-10 00:55:38,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 235 events. 64/235 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 966 event pairs, 56 based on Foata normal form. 16/225 useless extension candidates. Maximal degree in co-relation 435. Up to 148 conditions per place. [2025-01-10 00:55:38,905 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-01-10 00:55:38,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 263 flow [2025-01-10 00:55:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-01-10 00:55:38,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2025-01-10 00:55:38,907 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 167 flow. Second operand 3 states and 164 transitions. [2025-01-10 00:55:38,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 263 flow [2025-01-10 00:55:38,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:38,908 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 163 flow [2025-01-10 00:55:38,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-01-10 00:55:38,909 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-01-10 00:55:38,909 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 163 flow [2025-01-10 00:55:38,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:38,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,909 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:38,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:55:38,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:38,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1391932550, now seen corresponding path program 1 times [2025-01-10 00:55:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575722808] [2025-01-10 00:55:38,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:38,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:55:38,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:55:38,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:38,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575722808] [2025-01-10 00:55:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575722808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178455913] [2025-01-10 00:55:39,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:39,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:39,271 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 00:55:39,273 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 00:55:39,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:55:39,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:55:39,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:55:39,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:39,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:55:39,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:55:39,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-01-10 00:55:39,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-01-10 00:55:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:39,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:39,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:39,698 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 45 treesize of output 49 [2025-01-10 00:55:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:39,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178455913] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:39,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:39,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-01-10 00:55:39,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529533975] [2025-01-10 00:55:39,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:55:39,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:39,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:55:39,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:55:40,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-01-10 00:55:40,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 163 flow. Second operand has 19 states, 19 states have (on average 40.1578947368421) internal successors, (763), 19 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:40,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:40,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-01-10 00:55:40,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:40,913 INFO L124 PetriNetUnfolderBase]: 85/287 cut-off events. [2025-01-10 00:55:40,914 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-10 00:55:40,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 287 events. 85/287 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1269 event pairs, 60 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 539. Up to 152 conditions per place. [2025-01-10 00:55:40,915 INFO L140 encePairwiseOnDemand]: 59/71 looper letters, 46 selfloop transitions, 11 changer transitions 3/74 dead transitions. [2025-01-10 00:55:40,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 329 flow [2025-01-10 00:55:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:55:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:55:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 431 transitions. [2025-01-10 00:55:40,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6070422535211267 [2025-01-10 00:55:40,918 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 163 flow. Second operand 10 states and 431 transitions. [2025-01-10 00:55:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 329 flow [2025-01-10 00:55:40,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:40,920 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 194 flow [2025-01-10 00:55:40,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2025-01-10 00:55:40,920 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-01-10 00:55:40,920 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 194 flow [2025-01-10 00:55:40,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 40.1578947368421) internal successors, (763), 19 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:40,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:40,921 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:40,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:55:41,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:41,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:41,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1391932549, now seen corresponding path program 1 times [2025-01-10 00:55:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:41,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671887557] [2025-01-10 00:55:41,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:41,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:55:41,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:55:41,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:41,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 00:55:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671887557] [2025-01-10 00:55:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671887557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158007764] [2025-01-10 00:55:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:41,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:41,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:41,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:41,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-01-10 00:55:41,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:41,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:41,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-01-10 00:55:41,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:41,538 INFO L124 PetriNetUnfolderBase]: 79/265 cut-off events. [2025-01-10 00:55:41,538 INFO L125 PetriNetUnfolderBase]: For 101/109 co-relation queries the response was YES. [2025-01-10 00:55:41,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 265 events. 79/265 cut-off events. For 101/109 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1112 event pairs, 54 based on Foata normal form. 17/254 useless extension candidates. Maximal degree in co-relation 547. Up to 132 conditions per place. [2025-01-10 00:55:41,540 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 7 changer transitions 3/73 dead transitions. [2025-01-10 00:55:41,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 342 flow [2025-01-10 00:55:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2025-01-10 00:55:41,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737089201877934 [2025-01-10 00:55:41,541 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 194 flow. Second operand 6 states and 287 transitions. [2025-01-10 00:55:41,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 342 flow [2025-01-10 00:55:41,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 00:55:41,544 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 187 flow [2025-01-10 00:55:41,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2025-01-10 00:55:41,544 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-01-10 00:55:41,544 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 187 flow [2025-01-10 00:55:41,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:41,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:41,545 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:41,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:55:41,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:41,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1190461960, now seen corresponding path program 1 times [2025-01-10 00:55:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:41,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308303696] [2025-01-10 00:55:41,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:41,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:41,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:41,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:41,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308303696] [2025-01-10 00:55:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308303696] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740004787] [2025-01-10 00:55:41,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:41,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:41,983 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 00:55:41,985 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 00:55:42,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:42,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:42,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:42,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:42,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 00:55:42,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:42,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:42,297 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 00:55:42,304 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 14 treesize of output 9 [2025-01-10 00:55:42,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:55:42,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:42,375 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 14 treesize of output 9 [2025-01-10 00:55:42,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:42,513 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 14 treesize of output 9 [2025-01-10 00:55:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:42,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:42,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:42,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2025-01-10 00:55:42,825 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:42,826 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 13 treesize of output 12 [2025-01-10 00:55:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-10 00:55:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740004787] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:43,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:55:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 15 [2025-01-10 00:55:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314862163] [2025-01-10 00:55:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:43,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:43,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:43,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:55:43,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2025-01-10 00:55:43,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:43,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:43,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2025-01-10 00:55:43,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:43,926 INFO L124 PetriNetUnfolderBase]: 79/268 cut-off events. [2025-01-10 00:55:43,926 INFO L125 PetriNetUnfolderBase]: For 127/133 co-relation queries the response was YES. [2025-01-10 00:55:43,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 268 events. 79/268 cut-off events. For 127/133 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1163 event pairs, 47 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 561. Up to 166 conditions per place. [2025-01-10 00:55:43,943 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-01-10 00:55:43,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 63 transitions, 305 flow [2025-01-10 00:55:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2025-01-10 00:55:43,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7323943661971831 [2025-01-10 00:55:43,947 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 187 flow. Second operand 4 states and 208 transitions. [2025-01-10 00:55:43,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 63 transitions, 305 flow [2025-01-10 00:55:43,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 63 transitions, 285 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:55:43,949 INFO L231 Difference]: Finished difference. Result has 72 places, 55 transitions, 175 flow [2025-01-10 00:55:43,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=72, PETRI_TRANSITIONS=55} [2025-01-10 00:55:43,949 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2025-01-10 00:55:43,949 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 175 flow [2025-01-10 00:55:43,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:43,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:43,950 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:43,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:55:44,150 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,SelfDestructingSolverStorable15 [2025-01-10 00:55:44,151 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 200236607, now seen corresponding path program 1 times [2025-01-10 00:55:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292618441] [2025-01-10 00:55:44,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:44,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:44,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:44,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:44,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292618441] [2025-01-10 00:55:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292618441] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39350694] [2025-01-10 00:55:44,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:44,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:44,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:44,949 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 00:55:44,951 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 00:55:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:45,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:45,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:45,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-10 00:55:45,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:45,144 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 00:55:45,199 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-01-10 00:55:45,199 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 19 treesize of output 19 [2025-01-10 00:55:45,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:55:45,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 00:55:45,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-10 00:55:45,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-10 00:55:45,424 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-01-10 00:55:45,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 121 [2025-01-10 00:55:45,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 29 [2025-01-10 00:55:45,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 58 [2025-01-10 00:55:45,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2025-01-10 00:55:45,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:55:45,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2025-01-10 00:55:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:45,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:45,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:45,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-01-10 00:55:45,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:45,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2025-01-10 00:55:45,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2025-01-10 00:55:45,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:45,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2025-01-10 00:55:45,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:45,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2025-01-10 00:55:45,781 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:55:45,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:45,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2025-01-10 00:55:45,789 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:55:45,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:45,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 12 [2025-01-10 00:55:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39350694] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:45,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2025-01-10 00:55:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609934669] [2025-01-10 00:55:45,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:45,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 00:55:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:45,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 00:55:45,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=872, Unknown=19, NotChecked=0, Total=992 [2025-01-10 00:55:48,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 71 [2025-01-10 00:55:48,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 175 flow. Second operand has 32 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:48,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:48,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 71 [2025-01-10 00:55:48,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:49,557 INFO L124 PetriNetUnfolderBase]: 290/640 cut-off events. [2025-01-10 00:55:49,558 INFO L125 PetriNetUnfolderBase]: For 106/108 co-relation queries the response was YES. [2025-01-10 00:55:49,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 640 events. 290/640 cut-off events. For 106/108 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3002 event pairs, 71 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 1387. Up to 296 conditions per place. [2025-01-10 00:55:49,562 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 91 selfloop transitions, 18 changer transitions 0/110 dead transitions. [2025-01-10 00:55:49,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 521 flow [2025-01-10 00:55:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:55:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 00:55:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2025-01-10 00:55:49,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12776659959758552 [2025-01-10 00:55:49,564 INFO L175 Difference]: Start difference. First operand has 72 places, 55 transitions, 175 flow. Second operand 14 states and 127 transitions. [2025-01-10 00:55:49,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 521 flow [2025-01-10 00:55:49,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 110 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:49,568 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 267 flow [2025-01-10 00:55:49,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=267, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2025-01-10 00:55:49,569 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 15 predicate places. [2025-01-10 00:55:49,569 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 267 flow [2025-01-10 00:55:49,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:49,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:49,570 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:49,578 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 00:55:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 00:55:49,771 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:49,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 200236606, now seen corresponding path program 1 times [2025-01-10 00:55:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427266298] [2025-01-10 00:55:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:49,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:49,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:49,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:49,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:50,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:50,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427266298] [2025-01-10 00:55:50,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427266298] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:50,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198060130] [2025-01-10 00:55:50,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:50,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:50,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:50,378 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 00:55:50,379 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 00:55:50,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:50,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:50,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:50,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:50,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-10 00:55:50,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:50,570 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 00:55:50,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:55:50,619 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2025-01-10 00:55:50,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 37 [2025-01-10 00:55:50,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-10 00:55:50,777 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-01-10 00:55:50,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 89 [2025-01-10 00:55:50,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 46 [2025-01-10 00:55:50,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-01-10 00:55:50,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:55:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:50,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:50,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:50,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-01-10 00:55:50,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:50,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2025-01-10 00:55:50,993 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 17 treesize of output 5 [2025-01-10 00:55:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198060130] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:51,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2025-01-10 00:55:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171413830] [2025-01-10 00:55:51,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:51,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 00:55:51,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:51,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 00:55:51,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=882, Unknown=6, NotChecked=0, Total=992 [2025-01-10 00:55:53,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 71 [2025-01-10 00:55:53,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 267 flow. Second operand has 32 states, 32 states have (on average 8.65625) internal successors, (277), 32 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:53,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:53,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 71 [2025-01-10 00:55:53,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:53,882 INFO L124 PetriNetUnfolderBase]: 219/526 cut-off events. [2025-01-10 00:55:53,882 INFO L125 PetriNetUnfolderBase]: For 287/289 co-relation queries the response was YES. [2025-01-10 00:55:53,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 526 events. 219/526 cut-off events. For 287/289 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2430 event pairs, 56 based on Foata normal form. 15/483 useless extension candidates. Maximal degree in co-relation 1295. Up to 236 conditions per place. [2025-01-10 00:55:53,885 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 80 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2025-01-10 00:55:53,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 550 flow [2025-01-10 00:55:53,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:55:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 00:55:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 186 transitions. [2025-01-10 00:55:53,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18712273641851107 [2025-01-10 00:55:53,887 INFO L175 Difference]: Start difference. First operand has 88 places, 64 transitions, 267 flow. Second operand 14 states and 186 transitions. [2025-01-10 00:55:53,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 550 flow [2025-01-10 00:55:53,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 537 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 00:55:53,890 INFO L231 Difference]: Finished difference. Result has 96 places, 64 transitions, 300 flow [2025-01-10 00:55:53,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=300, PETRI_PLACES=96, PETRI_TRANSITIONS=64} [2025-01-10 00:55:53,891 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 23 predicate places. [2025-01-10 00:55:53,891 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 64 transitions, 300 flow [2025-01-10 00:55:53,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.65625) internal successors, (277), 32 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:53,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:53,891 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:53,901 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 00:55:54,092 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,SelfDestructingSolverStorable17 [2025-01-10 00:55:54,092 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1750384343, now seen corresponding path program 1 times [2025-01-10 00:55:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743284362] [2025-01-10 00:55:54,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:54,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:55:54,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:55:54,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:54,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:54,282 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:55:54,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:55:54,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:55:54,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:54,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:54,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:55:54,436 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:55:54,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2025-01-10 00:55:54,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-01-10 00:55:54,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-01-10 00:55:54,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-01-10 00:55:54,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-01-10 00:55:54,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2025-01-10 00:55:54,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-01-10 00:55:54,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-01-10 00:55:54,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-01-10 00:55:54,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-01-10 00:55:54,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-01-10 00:55:54,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-01-10 00:55:54,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-01-10 00:55:54,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-01-10 00:55:54,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-01-10 00:55:54,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-01-10 00:55:54,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2025-01-10 00:55:54,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:55:54,445 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:54,494 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:55:54,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:55:54,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:55:54 BasicIcfg [2025-01-10 00:55:54,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:55:54,502 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:55:54,502 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:55:54,502 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:55:54,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:31" (3/4) ... [2025-01-10 00:55:54,504 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 00:55:54,562 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 27. [2025-01-10 00:55:54,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:55:54,624 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:55:54,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:55:54,625 INFO L158 Benchmark]: Toolchain (without parser) took 24658.72ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 120.2MB in the beginning and 312.2MB in the end (delta: -192.0MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2025-01-10 00:55:54,625 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:54,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.56ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 79.7MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 00:55:54,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.18ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:54,625 INFO L158 Benchmark]: Boogie Preprocessor took 67.47ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 73.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:54,626 INFO L158 Benchmark]: RCFGBuilder took 1039.24ms. Allocated memory is still 167.8MB. Free memory was 73.4MB in the beginning and 47.3MB in the end (delta: 26.1MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2025-01-10 00:55:54,626 INFO L158 Benchmark]: TraceAbstraction took 22721.89ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 46.4MB in the beginning and 320.6MB in the end (delta: -274.2MB). Peak memory consumption was 154.0MB. Max. memory is 16.1GB. [2025-01-10 00:55:54,626 INFO L158 Benchmark]: Witness Printer took 121.99ms. Allocated memory is still 402.7MB. Free memory was 320.6MB in the beginning and 312.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:54,627 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.56ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 79.7MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.18ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.47ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 73.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1039.24ms. Allocated memory is still 167.8MB. Free memory was 73.4MB in the beginning and 47.3MB in the end (delta: 26.1MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22721.89ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 46.4MB in the beginning and 320.6MB in the end (delta: -274.2MB). Peak memory consumption was 154.0MB. Max. memory is 16.1GB. * Witness Printer took 121.99ms. Allocated memory is still 402.7MB. Free memory was 320.6MB in the beginning and 312.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] 0 struct s *p; [L1259] 0 pthread_t t1; [L1260] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1260] RET, EXPR 0 new(1) [L1260] 0 slot[j] = new(1) [L1261] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(2) [L1261] EXPR 0 slot[j] [L1261] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1261] RET 0 list_add(new(2), slot[j]) [L1262] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=5, mutex={1:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=8, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 96 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.5s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 51 mSolverCounterUnknown, 4024 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3167 mSDsluCounter, 4696 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4523 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17789 IncrementalHoareTripleChecker+Invalid, 17979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 173 mSDtfsCounter, 17789 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=18, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 485 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 548 ConstructedInterpolants, 29 QuantifiedInterpolants, 7355 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2326 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 30 InterpolantComputations, 13 PerfectInterpolantSequences, 1259/1315 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 00:55:54,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)