./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.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_17-arrayloop_nr.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 b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:43,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:43,229 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:43,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:43,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:43,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:43,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:43,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:43,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:43,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:43,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:43,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:43,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:43,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:43,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:43,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:43,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:43,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:43,251 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-01-10 00:55:43,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:43,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:43,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:43,515 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:43,515 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:43,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-01-10 00:55:44,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79c5da673/20b6be5a59da40a1ab4c05d46ca7c715/FLAG980ca2cc3 [2025-01-10 00:55:45,070 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:45,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-01-10 00:55:45,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79c5da673/20b6be5a59da40a1ab4c05d46ca7c715/FLAG980ca2cc3 [2025-01-10 00:55:45,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79c5da673/20b6be5a59da40a1ab4c05d46ca7c715 [2025-01-10 00:55:45,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:45,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:45,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:45,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:45,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:45,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:45" (1/1) ... [2025-01-10 00:55:45,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63171e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:45, skipping insertion in model container [2025-01-10 00:55:45,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:45" (1/1) ... [2025-01-10 00:55:45,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:45,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:45,627 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:45,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:45,746 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:45,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:45 WrapperNode [2025-01-10 00:55:45,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:45,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:45,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:45,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:45,754 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:45" (1/1) ... [2025-01-10 00:55:45,774 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:45" (1/1) ... [2025-01-10 00:55:45,800 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-01-10 00:55:45,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:45,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:45,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:45,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:45,809 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:45" (1/1) ... [2025-01-10 00:55:45,809 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:45" (1/1) ... [2025-01-10 00:55:45,812 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:45" (1/1) ... [2025-01-10 00:55:45,832 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:45,837 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:45" (1/1) ... [2025-01-10 00:55:45,837 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:45" (1/1) ... [2025-01-10 00:55:45,854 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:45" (1/1) ... [2025-01-10 00:55:45,855 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:45" (1/1) ... [2025-01-10 00:55:45,858 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:45" (1/1) ... [2025-01-10 00:55:45,859 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:45" (1/1) ... [2025-01-10 00:55:45,863 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:45" (1/1) ... [2025-01-10 00:55:45,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:45,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:45,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:45,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:45,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:45" (1/1) ... [2025-01-10 00:55:45,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:45,900 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:45,903 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:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 00:55:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 00:55:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 00:55:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:55:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:45,925 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:46,054 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:46,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:46,330 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:46,330 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:46,527 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:46,527 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:46,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:46 BoogieIcfgContainer [2025-01-10 00:55:46,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:46,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:46,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:46,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:46,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:45" (1/3) ... [2025-01-10 00:55:46,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c92172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:46, skipping insertion in model container [2025-01-10 00:55:46,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:45" (2/3) ... [2025-01-10 00:55:46,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c92172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:46, skipping insertion in model container [2025-01-10 00:55:46,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:46" (3/3) ... [2025-01-10 00:55:46,534 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-01-10 00:55:46,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:46,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 73 locations, 1 initial locations, 3 loop locations, and 37 error locations. [2025-01-10 00:55:46,544 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:46,586 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:46,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 154 flow [2025-01-10 00:55:46,630 INFO L124 PetriNetUnfolderBase]: 3/74 cut-off events. [2025-01-10 00:55:46,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:46,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 3/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2025-01-10 00:55:46,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 154 flow [2025-01-10 00:55:46,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 151 flow [2025-01-10 00:55:46,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:46,649 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;@110e4c08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:46,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 00:55:46,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:46,652 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:55:46,652 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:46,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:46,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:55:46,653 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:46,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 469635, now seen corresponding path program 1 times [2025-01-10 00:55:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260353218] [2025-01-10 00:55:46,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:46,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:55:46,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:55:46,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:46,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:46,919 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:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260353218] [2025-01-10 00:55:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260353218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538488862] [2025-01-10 00:55:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:46,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:46,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:46,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:46,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:47,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 75 [2025-01-10 00:55:47,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:47,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:47,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 75 [2025-01-10 00:55:47,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:47,246 INFO L124 PetriNetUnfolderBase]: 142/535 cut-off events. [2025-01-10 00:55:47,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:47,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 535 events. 142/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3300 event pairs, 99 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 804. Up to 246 conditions per place. [2025-01-10 00:55:47,250 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 37 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2025-01-10 00:55:47,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 245 flow [2025-01-10 00:55:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-01-10 00:55:47,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-01-10 00:55:47,267 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 151 flow. Second operand 3 states and 165 transitions. [2025-01-10 00:55:47,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 245 flow [2025-01-10 00:55:47,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:47,275 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 150 flow [2025-01-10 00:55:47,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, 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=150, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-01-10 00:55:47,284 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-01-10 00:55:47,284 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 150 flow [2025-01-10 00:55:47,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:47,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:47,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:55:47,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:47,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:47,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash 469636, now seen corresponding path program 1 times [2025-01-10 00:55:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:47,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44274835] [2025-01-10 00:55:47,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:47,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:55:47,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:55:47,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:47,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:47,418 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:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:47,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44274835] [2025-01-10 00:55:47,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44274835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:47,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:47,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:47,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283900425] [2025-01-10 00:55:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:47,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:47,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:47,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:47,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:47,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 75 [2025-01-10 00:55:47,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have 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:47,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:47,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 75 [2025-01-10 00:55:47,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:47,648 INFO L124 PetriNetUnfolderBase]: 132/503 cut-off events. [2025-01-10 00:55:47,648 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:55:47,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 503 events. 132/503 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3059 event pairs, 99 based on Foata normal form. 22/397 useless extension candidates. Maximal degree in co-relation 774. Up to 246 conditions per place. [2025-01-10 00:55:47,652 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-01-10 00:55:47,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 240 flow [2025-01-10 00:55:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-01-10 00:55:47,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511111111111111 [2025-01-10 00:55:47,653 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 150 flow. Second operand 3 states and 169 transitions. [2025-01-10 00:55:47,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 240 flow [2025-01-10 00:55:47,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:47,655 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 142 flow [2025-01-10 00:55:47,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2025-01-10 00:55:47,656 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-01-10 00:55:47,656 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 142 flow [2025-01-10 00:55:47,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have 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:47,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:47,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:55:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:55:47,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:47,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash 451332899, now seen corresponding path program 1 times [2025-01-10 00:55:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906155347] [2025-01-10 00:55:47,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:47,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:55:47,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:55:47,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:47,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:47,900 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:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906155347] [2025-01-10 00:55:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906155347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147599170] [2025-01-10 00:55:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:47,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:47,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:47,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:48,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-01-10 00:55:48,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have 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,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:48,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-01-10 00:55:48,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:48,103 INFO L124 PetriNetUnfolderBase]: 152/521 cut-off events. [2025-01-10 00:55:48,103 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 00:55:48,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 521 events. 152/521 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3051 event pairs, 126 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 833. Up to 307 conditions per place. [2025-01-10 00:55:48,108 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 31 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-01-10 00:55:48,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 198 flow [2025-01-10 00:55:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-01-10 00:55:48,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-01-10 00:55:48,110 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 142 flow. Second operand 3 states and 153 transitions. [2025-01-10 00:55:48,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 198 flow [2025-01-10 00:55:48,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:48,111 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 128 flow [2025-01-10 00:55:48,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-01-10 00:55:48,112 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2025-01-10 00:55:48,112 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 128 flow [2025-01-10 00:55:48,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have 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,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:48,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:55:48,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:48,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:48,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash 451332900, now seen corresponding path program 1 times [2025-01-10 00:55:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:48,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162786304] [2025-01-10 00:55:48,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:48,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:55:48,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:55:48,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:48,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:48,299 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:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162786304] [2025-01-10 00:55:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162786304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:48,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:48,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037366114] [2025-01-10 00:55:48,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:48,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:48,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:48,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:48,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-01-10 00:55:48,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:48,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:48,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-01-10 00:55:48,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:48,623 INFO L124 PetriNetUnfolderBase]: 152/519 cut-off events. [2025-01-10 00:55:48,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:48,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 519 events. 152/519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3014 event pairs, 126 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 829. Up to 308 conditions per place. [2025-01-10 00:55:48,629 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 31 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-01-10 00:55:48,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 204 flow [2025-01-10 00:55:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-01-10 00:55:48,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-01-10 00:55:48,634 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 128 flow. Second operand 4 states and 177 transitions. [2025-01-10 00:55:48,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 204 flow [2025-01-10 00:55:48,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:48,641 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 157 flow [2025-01-10 00:55:48,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-01-10 00:55:48,642 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-01-10 00:55:48,642 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 157 flow [2025-01-10 00:55:48,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:48,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:48,642 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1] [2025-01-10 00:55:48,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:55:48,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1734473455, now seen corresponding path program 1 times [2025-01-10 00:55:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:48,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010586110] [2025-01-10 00:55:48,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:48,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:48,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:48,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:48,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010586110] [2025-01-10 00:55:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010586110] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834259914] [2025-01-10 00:55:48,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:48,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:48,947 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:48,949 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:49,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:49,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:49,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:49,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:49,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:55:49,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:49,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:49,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:49,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:49,222 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:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:49,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:49,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:49,395 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 43 treesize of output 61 [2025-01-10 00:55:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834259914] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:49,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-01-10 00:55:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911925014] [2025-01-10 00:55:49,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:49,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:55:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:49,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:55:49,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:55:50,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-01-10 00:55:50,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 157 flow. Second operand has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have 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:50,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:50,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-01-10 00:55:50,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:51,139 INFO L124 PetriNetUnfolderBase]: 174/550 cut-off events. [2025-01-10 00:55:51,140 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:55:51,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 550 events. 174/550 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3085 event pairs, 0 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 939. Up to 188 conditions per place. [2025-01-10 00:55:51,142 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 59 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2025-01-10 00:55:51,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 391 flow [2025-01-10 00:55:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2025-01-10 00:55:51,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495238095238095 [2025-01-10 00:55:51,143 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 157 flow. Second operand 7 states and 341 transitions. [2025-01-10 00:55:51,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 391 flow [2025-01-10 00:55:51,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:51,145 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 213 flow [2025-01-10 00:55:51,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-01-10 00:55:51,146 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2025-01-10 00:55:51,146 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 213 flow [2025-01-10 00:55:51,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have 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:51,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:51,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:51,153 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:51,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:51,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:51,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2009379644, now seen corresponding path program 1 times [2025-01-10 00:55:51,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:51,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161620216] [2025-01-10 00:55:51,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:51,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:55:51,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:55:51,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:51,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:55:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:51,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161620216] [2025-01-10 00:55:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161620216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811053566] [2025-01-10 00:55:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:51,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:51,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:51,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 75 [2025-01-10 00:55:51,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:51,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:51,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 75 [2025-01-10 00:55:51,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:51,545 INFO L124 PetriNetUnfolderBase]: 254/899 cut-off events. [2025-01-10 00:55:51,546 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-10 00:55:51,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 899 events. 254/899 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5392 event pairs, 108 based on Foata normal form. 10/753 useless extension candidates. Maximal degree in co-relation 1572. Up to 300 conditions per place. [2025-01-10 00:55:51,551 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 51 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-01-10 00:55:51,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 89 transitions, 373 flow [2025-01-10 00:55:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-01-10 00:55:51,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2025-01-10 00:55:51,552 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 213 flow. Second operand 3 states and 191 transitions. [2025-01-10 00:55:51,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 89 transitions, 373 flow [2025-01-10 00:55:51,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:51,556 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 234 flow [2025-01-10 00:55:51,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-01-10 00:55:51,557 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-01-10 00:55:51,557 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 234 flow [2025-01-10 00:55:51,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:51,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:51,558 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:51,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:51,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:51,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1752103732, now seen corresponding path program 1 times [2025-01-10 00:55:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546274855] [2025-01-10 00:55:51,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:51,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:55:51,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:55:51,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:51,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:55:51,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:51,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546274855] [2025-01-10 00:55:51,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546274855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:51,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:51,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:51,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404041358] [2025-01-10 00:55:51,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:51,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:51,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:51,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:51,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:51,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2025-01-10 00:55:51,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:51,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:51,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2025-01-10 00:55:51,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:51,782 INFO L124 PetriNetUnfolderBase]: 279/939 cut-off events. [2025-01-10 00:55:51,782 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-01-10 00:55:51,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 939 events. 279/939 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5559 event pairs, 176 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 1750. Up to 473 conditions per place. [2025-01-10 00:55:51,787 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 53 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-01-10 00:55:51,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 405 flow [2025-01-10 00:55:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-01-10 00:55:51,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-01-10 00:55:51,789 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 234 flow. Second operand 3 states and 174 transitions. [2025-01-10 00:55:51,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 405 flow [2025-01-10 00:55:51,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:51,791 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 228 flow [2025-01-10 00:55:51,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-01-10 00:55:51,795 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2025-01-10 00:55:51,795 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 228 flow [2025-01-10 00:55:51,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:51,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:51,795 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:51,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:51,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:51,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1752103733, now seen corresponding path program 1 times [2025-01-10 00:55:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:51,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545233329] [2025-01-10 00:55:51,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:51,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:55:51,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:55:51,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:51,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:51,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545233329] [2025-01-10 00:55:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545233329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12136870] [2025-01-10 00:55:51,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:51,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:51,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:51,888 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:51,892 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:51,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:55:51,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:55:51,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:51,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:55:51,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:52,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12136870] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:52,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 00:55:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722491810] [2025-01-10 00:55:52,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:52,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:52,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:52,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:52,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-01-10 00:55:52,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 228 flow. Second operand has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have 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:52,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:52,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-01-10 00:55:52,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:52,502 INFO L124 PetriNetUnfolderBase]: 702/2303 cut-off events. [2025-01-10 00:55:52,503 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-01-10 00:55:52,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 2303 events. 702/2303 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 13104 event pairs, 27 based on Foata normal form. 54/1987 useless extension candidates. Maximal degree in co-relation 4176. Up to 234 conditions per place. [2025-01-10 00:55:52,514 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 146 selfloop transitions, 16 changer transitions 0/191 dead transitions. [2025-01-10 00:55:52,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 191 transitions, 869 flow [2025-01-10 00:55:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:55:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:55:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 531 transitions. [2025-01-10 00:55:52,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-01-10 00:55:52,517 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 228 flow. Second operand 8 states and 531 transitions. [2025-01-10 00:55:52,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 191 transitions, 869 flow [2025-01-10 00:55:52,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 191 transitions, 839 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:52,522 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 330 flow [2025-01-10 00:55:52,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2025-01-10 00:55:52,524 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2025-01-10 00:55:52,524 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 330 flow [2025-01-10 00:55:52,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have 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:52,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:52,525 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 1, 1] [2025-01-10 00:55:52,532 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:52,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:52,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:52,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1445377712, now seen corresponding path program 2 times [2025-01-10 00:55:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601993484] [2025-01-10 00:55:52,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:52,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 00:55:52,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:52,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:55:52,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:53,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601993484] [2025-01-10 00:55:53,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601993484] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:53,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594261413] [2025-01-10 00:55:53,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:53,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:53,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:53,468 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:53,471 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:53,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 00:55:53,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:53,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:55:53,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:53,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 00:55:53,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:53,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:53,628 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:53,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:53,691 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:53,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:53,752 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:53,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:53,813 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:53,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:53,900 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:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:53,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:54,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:54,057 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 43 treesize of output 61 [2025-01-10 00:55:54,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:54,190 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 43 treesize of output 61 [2025-01-10 00:55:54,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:54,382 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 43 treesize of output 61 [2025-01-10 00:55:54,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:54,529 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 43 treesize of output 61 [2025-01-10 00:55:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594261413] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:54,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2025-01-10 00:55:54,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378196495] [2025-01-10 00:55:54,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:54,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 00:55:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:54,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 00:55:54,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 00:56:00,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:56:00,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 330 flow. Second operand has 33 states, 33 states have (on average 35.45454545454545) internal successors, (1170), 33 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have 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:56:00,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:00,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:56:00,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:01,533 INFO L124 PetriNetUnfolderBase]: 802/2682 cut-off events. [2025-01-10 00:56:01,533 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2025-01-10 00:56:01,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 2682 events. 802/2682 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 16429 event pairs, 224 based on Foata normal form. 6/2174 useless extension candidates. Maximal degree in co-relation 5050. Up to 855 conditions per place. [2025-01-10 00:56:01,548 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 93 selfloop transitions, 26 changer transitions 0/147 dead transitions. [2025-01-10 00:56:01,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 147 transitions, 890 flow [2025-01-10 00:56:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:56:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 00:56:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 596 transitions. [2025-01-10 00:56:01,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5676190476190476 [2025-01-10 00:56:01,551 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 330 flow. Second operand 14 states and 596 transitions. [2025-01-10 00:56:01,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 147 transitions, 890 flow [2025-01-10 00:56:01,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 147 transitions, 872 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 00:56:01,555 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 501 flow [2025-01-10 00:56:01,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=501, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-01-10 00:56:01,556 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 31 predicate places. [2025-01-10 00:56:01,556 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 501 flow [2025-01-10 00:56:01,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 35.45454545454545) internal successors, (1170), 33 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have 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:56:01,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:01,557 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:01,567 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:56:01,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:01,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:56:01,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash 808069513, now seen corresponding path program 2 times [2025-01-10 00:56:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150170240] [2025-01-10 00:56:01,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:56:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:01,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 00:56:01,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 32 statements. [2025-01-10 00:56:01,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:56:01,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-10 00:56:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150170240] [2025-01-10 00:56:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150170240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:56:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101239988] [2025-01-10 00:56:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:01,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:56:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:01,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:56:01,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:56:01,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2025-01-10 00:56:01,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:56:01,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:01,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2025-01-10 00:56:01,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:02,155 INFO L124 PetriNetUnfolderBase]: 685/2352 cut-off events. [2025-01-10 00:56:02,156 INFO L125 PetriNetUnfolderBase]: For 1442/1442 co-relation queries the response was YES. [2025-01-10 00:56:02,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 2352 events. 685/2352 cut-off events. For 1442/1442 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13742 event pairs, 504 based on Foata normal form. 68/2061 useless extension candidates. Maximal degree in co-relation 4713. Up to 1260 conditions per place. [2025-01-10 00:56:02,207 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 73 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-01-10 00:56:02,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 803 flow [2025-01-10 00:56:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:56:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:56:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-01-10 00:56:02,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7822222222222223 [2025-01-10 00:56:02,208 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 501 flow. Second operand 3 states and 176 transitions. [2025-01-10 00:56:02,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 803 flow [2025-01-10 00:56:02,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 757 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-10 00:56:02,213 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 462 flow [2025-01-10 00:56:02,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2025-01-10 00:56:02,214 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 26 predicate places. [2025-01-10 00:56:02,214 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 462 flow [2025-01-10 00:56:02,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:56:02,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:02,214 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:02,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:56:02,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:56:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash -834264343, now seen corresponding path program 1 times [2025-01-10 00:56:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980768402] [2025-01-10 00:56:02,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:02,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:56:02,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:56:02,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:02,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980768402] [2025-01-10 00:56:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980768402] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759577748] [2025-01-10 00:56:02,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:02,388 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:56:02,389 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:56:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:56:02,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:56:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:02,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:56:02,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:02,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:56:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:02,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759577748] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:56:02,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:56:02,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-01-10 00:56:02,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431228239] [2025-01-10 00:56:02,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:56:02,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:56:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:02,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:56:02,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:56:02,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-01-10 00:56:02,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 462 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have 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:56:02,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:02,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-01-10 00:56:02,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:03,423 INFO L124 PetriNetUnfolderBase]: 1142/3774 cut-off events. [2025-01-10 00:56:03,423 INFO L125 PetriNetUnfolderBase]: For 2020/2020 co-relation queries the response was YES. [2025-01-10 00:56:03,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7423 conditions, 3774 events. 1142/3774 cut-off events. For 2020/2020 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 21608 event pairs, 88 based on Foata normal form. 44/3193 useless extension candidates. Maximal degree in co-relation 7392. Up to 235 conditions per place. [2025-01-10 00:56:03,445 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 234 selfloop transitions, 25 changer transitions 0/286 dead transitions. [2025-01-10 00:56:03,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 286 transitions, 1577 flow [2025-01-10 00:56:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:56:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:56:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 806 transitions. [2025-01-10 00:56:03,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8955555555555555 [2025-01-10 00:56:03,448 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 462 flow. Second operand 12 states and 806 transitions. [2025-01-10 00:56:03,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 286 transitions, 1577 flow [2025-01-10 00:56:03,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 286 transitions, 1531 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:56:03,456 INFO L231 Difference]: Finished difference. Result has 115 places, 84 transitions, 574 flow [2025-01-10 00:56:03,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=574, PETRI_PLACES=115, PETRI_TRANSITIONS=84} [2025-01-10 00:56:03,457 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 40 predicate places. [2025-01-10 00:56:03,457 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 84 transitions, 574 flow [2025-01-10 00:56:03,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have 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:56:03,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:03,457 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 1, 1] [2025-01-10 00:56:03,464 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:56:03,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 00:56:03,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:56:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash -436629102, now seen corresponding path program 3 times [2025-01-10 00:56:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214062234] [2025-01-10 00:56:03,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:56:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:03,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-01-10 00:56:03,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 00:56:03,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 00:56:03,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 183 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:04,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:04,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214062234] [2025-01-10 00:56:04,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214062234] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:04,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688015819] [2025-01-10 00:56:04,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:56:04,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:04,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:04,075 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:56:04,079 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:56:04,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-01-10 00:56:38,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 00:56:38,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 00:56:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:38,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 00:56:38,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:38,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688015819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:56:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2025-01-10 00:56:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670826268] [2025-01-10 00:56:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:56:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:38,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:56:38,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:56:38,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-01-10 00:56:38,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 84 transitions, 574 flow. Second operand has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have 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:56:38,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:38,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-01-10 00:56:38,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:39,582 INFO L124 PetriNetUnfolderBase]: 1131/3759 cut-off events. [2025-01-10 00:56:39,583 INFO L125 PetriNetUnfolderBase]: For 2250/2250 co-relation queries the response was YES. [2025-01-10 00:56:39,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 3759 events. 1131/3759 cut-off events. For 2250/2250 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 21579 event pairs, 80 based on Foata normal form. 11/3145 useless extension candidates. Maximal degree in co-relation 7349. Up to 228 conditions per place. [2025-01-10 00:56:39,603 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 242 selfloop transitions, 23 changer transitions 1/292 dead transitions. [2025-01-10 00:56:39,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 292 transitions, 1615 flow [2025-01-10 00:56:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:56:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:56:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2025-01-10 00:56:39,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748717948717949 [2025-01-10 00:56:39,605 INFO L175 Difference]: Start difference. First operand has 115 places, 84 transitions, 574 flow. Second operand 13 states and 853 transitions. [2025-01-10 00:56:39,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 292 transitions, 1615 flow [2025-01-10 00:56:39,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 292 transitions, 1513 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-01-10 00:56:39,614 INFO L231 Difference]: Finished difference. Result has 111 places, 80 transitions, 487 flow [2025-01-10 00:56:39,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=487, PETRI_PLACES=111, PETRI_TRANSITIONS=80} [2025-01-10 00:56:39,615 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 36 predicate places. [2025-01-10 00:56:39,615 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 80 transitions, 487 flow [2025-01-10 00:56:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have 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:56:39,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:39,615 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:39,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:56:39,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 00:56:39,816 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:56:39,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:39,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1455023165, now seen corresponding path program 2 times [2025-01-10 00:56:39,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:39,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895630692] [2025-01-10 00:56:39,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:56:39,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:39,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-10 00:56:39,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:56:39,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:56:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895630692] [2025-01-10 00:56:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895630692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326526714] [2025-01-10 00:56:40,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:56:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:40,307 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:56:40,313 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:56:40,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-10 00:56:40,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:56:40,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:56:40,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:40,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:56:40,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:40,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:40,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 00:56:40,728 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:56:40,728 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:56:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:40,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:56:40,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-01-10 00:56:40,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:40,892 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 46 treesize of output 64 [2025-01-10 00:56:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326526714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:56:41,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:56:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2025-01-10 00:56:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503210917] [2025-01-10 00:56:41,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:56:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 00:56:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:41,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 00:56:41,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2025-01-10 00:56:42,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-01-10 00:56:42,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 80 transitions, 487 flow. Second operand has 31 states, 31 states have (on average 40.67741935483871) internal successors, (1261), 31 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have 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:56:42,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:42,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-01-10 00:56:42,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:45,793 INFO L124 PetriNetUnfolderBase]: 2713/8846 cut-off events. [2025-01-10 00:56:45,794 INFO L125 PetriNetUnfolderBase]: For 4194/4194 co-relation queries the response was YES. [2025-01-10 00:56:45,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16600 conditions, 8846 events. 2713/8846 cut-off events. For 4194/4194 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 66179 event pairs, 138 based on Foata normal form. 114/7399 useless extension candidates. Maximal degree in co-relation 16572. Up to 342 conditions per place. [2025-01-10 00:56:45,832 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 627 selfloop transitions, 120 changer transitions 2/775 dead transitions. [2025-01-10 00:56:45,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 775 transitions, 3907 flow [2025-01-10 00:56:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 00:56:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-01-10 00:56:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2530 transitions. [2025-01-10 00:56:45,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-01-10 00:56:45,841 INFO L175 Difference]: Start difference. First operand has 111 places, 80 transitions, 487 flow. Second operand 46 states and 2530 transitions. [2025-01-10 00:56:45,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 775 transitions, 3907 flow [2025-01-10 00:56:45,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 775 transitions, 3789 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-10 00:56:45,855 INFO L231 Difference]: Finished difference. Result has 188 places, 177 transitions, 1471 flow [2025-01-10 00:56:45,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1471, PETRI_PLACES=188, PETRI_TRANSITIONS=177} [2025-01-10 00:56:45,856 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 113 predicate places. [2025-01-10 00:56:45,856 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 177 transitions, 1471 flow [2025-01-10 00:56:45,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 40.67741935483871) internal successors, (1261), 31 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have 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:56:45,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:45,856 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:45,864 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:56:46,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 00:56:46,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:56:46,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:46,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1997384416, now seen corresponding path program 1 times [2025-01-10 00:56:46,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:46,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45951943] [2025-01-10 00:56:46,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:46,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:56:46,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:56:46,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:46,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45951943] [2025-01-10 00:56:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45951943] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129386930] [2025-01-10 00:56:46,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:46,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:46,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:46,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:56:46,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:56:46,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:56:46,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:56:46,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:46,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:56:46,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:46,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:46,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 00:56:46,978 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:56:46,978 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:56:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:46,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:56:47,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-01-10 00:56:47,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:47,142 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 46 treesize of output 64 [2025-01-10 00:56:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:47,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129386930] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:56:47,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:56:47,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2025-01-10 00:56:47,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715116306] [2025-01-10 00:56:47,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:56:47,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 00:56:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:47,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 00:56:47,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2025-01-10 00:56:48,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:56:48,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 177 transitions, 1471 flow. Second operand has 29 states, 29 states have (on average 36.758620689655174) internal successors, (1066), 29 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have 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:56:48,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:48,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:56:48,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:50,879 INFO L124 PetriNetUnfolderBase]: 2784/8787 cut-off events. [2025-01-10 00:56:50,880 INFO L125 PetriNetUnfolderBase]: For 72552/72663 co-relation queries the response was YES. [2025-01-10 00:56:50,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29308 conditions, 8787 events. 2784/8787 cut-off events. For 72552/72663 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 64719 event pairs, 290 based on Foata normal form. 46/7384 useless extension candidates. Maximal degree in co-relation 29236. Up to 671 conditions per place. [2025-01-10 00:56:50,992 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 425 selfloop transitions, 83 changer transitions 1/535 dead transitions. [2025-01-10 00:56:50,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 535 transitions, 5349 flow [2025-01-10 00:56:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 00:56:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 00:56:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1104 transitions. [2025-01-10 00:56:50,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6690909090909091 [2025-01-10 00:56:50,995 INFO L175 Difference]: Start difference. First operand has 188 places, 177 transitions, 1471 flow. Second operand 22 states and 1104 transitions. [2025-01-10 00:56:50,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 535 transitions, 5349 flow [2025-01-10 00:56:51,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 535 transitions, 5258 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-01-10 00:56:51,071 INFO L231 Difference]: Finished difference. Result has 201 places, 201 transitions, 1684 flow [2025-01-10 00:56:51,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1684, PETRI_PLACES=201, PETRI_TRANSITIONS=201} [2025-01-10 00:56:51,072 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 126 predicate places. [2025-01-10 00:56:51,073 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 201 transitions, 1684 flow [2025-01-10 00:56:51,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 36.758620689655174) internal successors, (1066), 29 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have 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:56:51,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:51,073 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:51,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:56:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:51,274 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:56:51,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2138921601, now seen corresponding path program 1 times [2025-01-10 00:56:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-01-10 00:56:51,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:51,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 00:56:51,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 00:56:51,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:51,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 95 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-01-10 00:56:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902402782] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:54,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532533799] [2025-01-10 00:56:54,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:54,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:54,442 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:56:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:56:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 00:56:54,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 00:56:54,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:54,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:54,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-10 00:56:54,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:54,753 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:56:54,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:56:54,789 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-10 00:56:54,789 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 23 treesize of output 24 [2025-01-10 00:56:54,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:54,804 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 29 treesize of output 13 [2025-01-10 00:56:54,823 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:54,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:54,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:54,874 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 29 treesize of output 13 [2025-01-10 00:56:54,916 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-10 00:56:54,917 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 23 treesize of output 24 [2025-01-10 00:56:54,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:54,949 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 29 treesize of output 13 [2025-01-10 00:56:54,962 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:54,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:54,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:54,992 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 29 treesize of output 13 [2025-01-10 00:56:55,003 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:55,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:55,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:55,029 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 29 treesize of output 13 [2025-01-10 00:56:55,041 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:55,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:55,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:55,067 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 29 treesize of output 13 [2025-01-10 00:56:55,080 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:55,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:55,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:55,110 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 29 treesize of output 13 [2025-01-10 00:56:55,121 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:55,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:55,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:55,147 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 29 treesize of output 13 [2025-01-10 00:56:55,177 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:55,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:55,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:56:55,233 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 29 treesize of output 13 [2025-01-10 00:56:55,268 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-10 00:56:55,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:56:55,299 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 17 treesize of output 9 [2025-01-10 00:56:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:55,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:56:59,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2871 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2871) |c_~#slot~0.offset|)) 1)) is different from false [2025-01-10 00:57:14,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_103| Int) (|v_ULTIMATE.start_new_~p~0#1.base_102| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_206| Int) (v_ArrVal_2868 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |v_ULTIMATE.start_main_~j~0#1_206| 1)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_103| 1) |v_ULTIMATE.start_new_~p~0#1.base_102| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_206| 4)) v_ArrVal_2868) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) v_ArrVal_2871) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_206| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2025-01-10 00:57:16,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_104| Int) (|v_ULTIMATE.start_new_~p~0#1.base_103| Int) (|v_ULTIMATE.start_new_~p~0#1.base_102| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_206| Int) (v_ArrVal_2868 Int)) (or (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_104| 1) |v_ULTIMATE.start_new_~p~0#1.base_103| 1) |v_ULTIMATE.start_new_~p~0#1.base_102| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_206| 4)) v_ArrVal_2868) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) v_ArrVal_2871) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |v_ULTIMATE.start_main_~j~0#1_206| 1)) (< |v_ULTIMATE.start_main_~j~0#1_206| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2025-01-10 00:57:18,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_104| Int) (|v_ULTIMATE.start_new_~p~0#1.base_103| Int) (|v_ULTIMATE.start_new_~p~0#1.base_102| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (v_ArrVal_2862 Int) (|v_ULTIMATE.start_main_~j~0#1_207| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_206| Int) (v_ArrVal_2868 Int)) (or (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_104| 1) |v_ULTIMATE.start_new_~p~0#1.base_103| 1) |v_ULTIMATE.start_new_~p~0#1.base_102| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2862) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_207| 4)) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_206| 4)) v_ArrVal_2868) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) v_ArrVal_2871) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_207| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_206| (+ |v_ULTIMATE.start_main_~j~0#1_207| 1)) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |v_ULTIMATE.start_main_~j~0#1_206| 1)))) is different from false [2025-01-10 00:57:21,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_105| Int) (|v_ULTIMATE.start_new_~p~0#1.base_104| Int) (|v_ULTIMATE.start_new_~p~0#1.base_103| Int) (|v_ULTIMATE.start_new_~p~0#1.base_102| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (v_ArrVal_2862 Int) (|v_ULTIMATE.start_main_~j~0#1_207| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_206| Int) (v_ArrVal_2868 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_207| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_206| (+ |v_ULTIMATE.start_main_~j~0#1_207| 1)) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |v_ULTIMATE.start_main_~j~0#1_206| 1)) (= (select (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_105| 1) |v_ULTIMATE.start_new_~p~0#1.base_104| 1) |v_ULTIMATE.start_new_~p~0#1.base_103| 1) |v_ULTIMATE.start_new_~p~0#1.base_102| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2862) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_207| 4)) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_206| 4)) v_ArrVal_2868) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) v_ArrVal_2871) |c_~#slot~0.offset|)) 1))) is different from false