./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:58:53,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:58:53,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:58:53,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:58:53,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:58:53,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:58:53,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:58:53,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:58:53,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:58:53,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:58:53,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:58:53,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:58:53,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:58:53,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:58:53,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:53,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:58:53,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:58:53,228 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/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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2025-03-17 11:58:53,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:58:53,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:58:53,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:58:53,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:58:53,465 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:58:53,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2025-03-17 11:58:54,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8429d1ce/9959f70cda774b9199cb4e3ba31cf1cf/FLAG807fcb7c4 [2025-03-17 11:58:54,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:58:54,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2025-03-17 11:58:54,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8429d1ce/9959f70cda774b9199cb4e3ba31cf1cf/FLAG807fcb7c4 [2025-03-17 11:58:54,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8429d1ce/9959f70cda774b9199cb4e3ba31cf1cf [2025-03-17 11:58:54,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:58:54,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:58:54,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:54,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:58:54,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:58:54,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:54" (1/1) ... [2025-03-17 11:58:54,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27660c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:54, skipping insertion in model container [2025-03-17 11:58:54,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:54" (1/1) ... [2025-03-17 11:58:54,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:58:55,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:55,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:58:55,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:55,200 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:58:55,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55 WrapperNode [2025-03-17 11:58:55,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:55,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:55,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:58:55,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:58:55,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,234 INFO L138 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 344 [2025-03-17 11:58:55,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:55,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:58:55,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:58:55,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:58:55,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,267 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 10, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 5, 6]. [2025-03-17 11:58:55,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,276 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:58:55,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:58:55,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:58:55,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:58:55,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (1/1) ... [2025-03-17 11:58:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:55,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:55,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:58:55,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:58:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:58:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:58:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:58:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:58:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:58:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:58:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:58:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:58:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:58:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:58:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:58:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:58:55,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:58:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-03-17 11:58:55,332 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-03-17 11:58:55,436 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:58:55,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:58:55,954 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc containsHead_#t~mem3#1;havoc containsHead_#t~mem4#1.base, containsHead_#t~mem4#1.offset;havoc containsHead_#t~mem5#1;havoc containsHead_#t~short6#1;havoc containsHead_#t~mem7#1.base, containsHead_#t~mem7#1.offset;havoc containsHead_#t~mem8#1.base, containsHead_#t~mem8#1.offset;havoc containsHead_#t~mem9#1;havoc containsHead_#t~short10#1;havoc containsHead_#t~mem11#1.base, containsHead_#t~mem11#1.offset;havoc containsHead_#t~mem12#1.base, containsHead_#t~mem12#1.offset;havoc containsHead_#t~mem13#1.base, containsHead_#t~mem13#1.offset;havoc containsHead_#t~mem14#1;havoc containsHead_#t~short15#1;havoc containsHead_#t~mem16#1.base, containsHead_#t~mem16#1.offset;havoc containsHead_#t~mem17#1.base, containsHead_#t~mem17#1.offset;havoc containsHead_#t~mem18#1.base, containsHead_#t~mem18#1.offset;havoc containsHead_#t~mem19#1.base, containsHead_#t~mem19#1.offset;havoc containsHead_#t~mem20#1;havoc containsHead_#t~short21#1;havoc containsHead_#t~mem22#1.base, containsHead_#t~mem22#1.offset;havoc containsHead_#t~mem23#1.base, containsHead_#t~mem23#1.offset;havoc containsHead_#t~mem24#1.base, containsHead_#t~mem24#1.offset;havoc containsHead_#t~mem25#1.base, containsHead_#t~mem25#1.offset;havoc containsHead_#t~mem26#1.base, containsHead_#t~mem26#1.offset;havoc containsHead_#t~mem27#1;havoc containsHead_#t~short28#1; [2025-03-17 11:58:55,954 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L555: havoc containsBody_#t~mem29#1;havoc containsBody_#t~mem30#1.base, containsBody_#t~mem30#1.offset;havoc containsBody_#t~mem31#1;havoc containsBody_#t~short32#1;havoc containsBody_#t~mem33#1.base, containsBody_#t~mem33#1.offset;havoc containsBody_#t~mem34#1.base, containsBody_#t~mem34#1.offset;havoc containsBody_#t~mem35#1;havoc containsBody_#t~short36#1;havoc containsBody_#t~mem37#1.base, containsBody_#t~mem37#1.offset;havoc containsBody_#t~mem38#1.base, containsBody_#t~mem38#1.offset;havoc containsBody_#t~mem39#1.base, containsBody_#t~mem39#1.offset;havoc containsBody_#t~mem40#1;havoc containsBody_#t~short41#1;havoc containsBody_#t~mem42#1.base, containsBody_#t~mem42#1.offset;havoc containsBody_#t~mem43#1.base, containsBody_#t~mem43#1.offset;havoc containsBody_#t~mem44#1.base, containsBody_#t~mem44#1.offset;havoc containsBody_#t~mem45#1.base, containsBody_#t~mem45#1.offset;havoc containsBody_#t~mem46#1;havoc containsBody_#t~short47#1;havoc containsBody_#t~mem48#1.base, containsBody_#t~mem48#1.offset;havoc containsBody_#t~mem49#1.base, containsBody_#t~mem49#1.offset;havoc containsBody_#t~mem50#1.base, containsBody_#t~mem50#1.offset;havoc containsBody_#t~mem51#1.base, containsBody_#t~mem51#1.offset;havoc containsBody_#t~mem52#1.base, containsBody_#t~mem52#1.offset;havoc containsBody_#t~mem53#1;havoc containsBody_#t~short54#1; [2025-03-17 11:58:56,056 INFO L? ?]: Removed 360 outVars from TransFormulas that were not future-live. [2025-03-17 11:58:56,057 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:58:56,070 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:58:56,074 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:58:56,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:56 BoogieIcfgContainer [2025-03-17 11:58:56,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:58:56,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:58:56,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:58:56,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:58:56,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:58:54" (1/3) ... [2025-03-17 11:58:56,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd7de08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:56, skipping insertion in model container [2025-03-17 11:58:56,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:55" (2/3) ... [2025-03-17 11:58:56,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd7de08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:56, skipping insertion in model container [2025-03-17 11:58:56,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:56" (3/3) ... [2025-03-17 11:58:56,082 INFO L128 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2025-03-17 11:58:56,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:58:56,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG split_list_test05-1.i that has 2 procedures, 320 locations, 1 initial locations, 11 loop locations, and 147 error locations. [2025-03-17 11:58:56,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:58:56,132 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;@409b3b2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:58:56,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-03-17 11:58:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 157 states have (on average 2.121019108280255) internal successors, (333), 306 states have internal predecessors, (333), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:58:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:58:56,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:56,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:58:56,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:56,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash 10687, now seen corresponding path program 1 times [2025-03-17 11:58:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061369802] [2025-03-17 11:58:56,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:56,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:58:56,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:58:56,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:56,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:56,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061369802] [2025-03-17 11:58:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061369802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:56,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:56,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:58:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538694433] [2025-03-17 11:58:56,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:56,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:56,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:56,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:56,323 INFO L87 Difference]: Start difference. First operand has 320 states, 157 states have (on average 2.121019108280255) internal successors, (333), 306 states have internal predecessors, (333), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:56,640 INFO L93 Difference]: Finished difference Result 544 states and 598 transitions. [2025-03-17 11:58:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:56,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 11:58:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:56,654 INFO L225 Difference]: With dead ends: 544 [2025-03-17 11:58:56,654 INFO L226 Difference]: Without dead ends: 542 [2025-03-17 11:58:56,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:56,658 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 243 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:56,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 442 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:58:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-17 11:58:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 404. [2025-03-17 11:58:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 244 states have (on average 2.1024590163934427) internal successors, (513), 390 states have internal predecessors, (513), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:58:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 541 transitions. [2025-03-17 11:58:56,708 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 541 transitions. Word has length 2 [2025-03-17 11:58:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:56,708 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 541 transitions. [2025-03-17 11:58:56,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 541 transitions. [2025-03-17 11:58:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:58:56,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:56,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:58:56,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:58:56,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:56,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 10688, now seen corresponding path program 1 times [2025-03-17 11:58:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123309491] [2025-03-17 11:58:56,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:56,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:58:56,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:58:56,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:56,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123309491] [2025-03-17 11:58:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123309491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:56,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:58:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868632996] [2025-03-17 11:58:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:56,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:56,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:56,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:56,800 INFO L87 Difference]: Start difference. First operand 404 states and 541 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:56,982 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2025-03-17 11:58:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:56,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 11:58:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:56,984 INFO L225 Difference]: With dead ends: 405 [2025-03-17 11:58:56,984 INFO L226 Difference]: Without dead ends: 405 [2025-03-17 11:58:56,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:56,984 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:56,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 560 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-17 11:58:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2025-03-17 11:58:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 244 states have (on average 2.0942622950819674) internal successors, (511), 388 states have internal predecessors, (511), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:58:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2025-03-17 11:58:57,006 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 2 [2025-03-17 11:58:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:57,006 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2025-03-17 11:58:57,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2025-03-17 11:58:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:58:57,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:57,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:57,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:58:57,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:57,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash -924333120, now seen corresponding path program 1 times [2025-03-17 11:58:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:57,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811286771] [2025-03-17 11:58:57,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:57,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:58:57,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:58:57,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:57,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:57,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811286771] [2025-03-17 11:58:57,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811286771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:57,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:57,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931491581] [2025-03-17 11:58:57,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:57,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:57,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:57,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:57,134 INFO L87 Difference]: Start difference. First operand 402 states and 539 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:57,288 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2025-03-17 11:58:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:58:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:57,290 INFO L225 Difference]: With dead ends: 397 [2025-03-17 11:58:57,290 INFO L226 Difference]: Without dead ends: 397 [2025-03-17 11:58:57,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:57,291 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 35 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:57,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 520 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-17 11:58:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-17 11:58:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 244 states have (on average 2.0737704918032787) internal successors, (506), 383 states have internal predecessors, (506), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:58:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2025-03-17 11:58:57,309 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 9 [2025-03-17 11:58:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:57,310 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2025-03-17 11:58:57,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2025-03-17 11:58:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:58:57,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:57,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:57,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:58:57,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:57,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash -924333121, now seen corresponding path program 1 times [2025-03-17 11:58:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251211760] [2025-03-17 11:58:57,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:57,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:58:57,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:58:57,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:57,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251211760] [2025-03-17 11:58:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251211760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:57,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:57,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308413528] [2025-03-17 11:58:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:57,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:57,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:57,379 INFO L87 Difference]: Start difference. First operand 397 states and 534 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:57,513 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2025-03-17 11:58:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:58:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:57,515 INFO L225 Difference]: With dead ends: 392 [2025-03-17 11:58:57,515 INFO L226 Difference]: Without dead ends: 392 [2025-03-17 11:58:57,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:57,517 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 35 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:57,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 507 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-17 11:58:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-17 11:58:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 244 states have (on average 2.05327868852459) internal successors, (501), 378 states have internal predecessors, (501), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:58:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2025-03-17 11:58:57,530 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 9 [2025-03-17 11:58:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:57,530 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2025-03-17 11:58:57,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2025-03-17 11:58:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:58:57,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:57,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:57,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:58:57,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:57,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1410444638, now seen corresponding path program 1 times [2025-03-17 11:58:57,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:57,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809202240] [2025-03-17 11:58:57,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:57,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:58:57,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:58:57,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:57,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809202240] [2025-03-17 11:58:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809202240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:57,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:57,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123685787] [2025-03-17 11:58:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:57,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:58:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:57,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:58:57,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:57,726 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:58,111 INFO L93 Difference]: Finished difference Result 519 states and 571 transitions. [2025-03-17 11:58:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:58:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:58,114 INFO L225 Difference]: With dead ends: 519 [2025-03-17 11:58:58,114 INFO L226 Difference]: Without dead ends: 519 [2025-03-17 11:58:58,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:58,115 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 321 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:58,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 640 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:58:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-17 11:58:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 384. [2025-03-17 11:58:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 244 states have (on average 2.0204918032786887) internal successors, (493), 370 states have internal predecessors, (493), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:58:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 521 transitions. [2025-03-17 11:58:58,126 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 521 transitions. Word has length 10 [2025-03-17 11:58:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:58,126 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 521 transitions. [2025-03-17 11:58:58,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2025-03-17 11:58:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:58:58,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:58,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:58,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:58:58,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:58,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1410444639, now seen corresponding path program 1 times [2025-03-17 11:58:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:58,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962565267] [2025-03-17 11:58:58,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:58,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:58:58,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:58:58,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:58,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962565267] [2025-03-17 11:58:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962565267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:58,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585790602] [2025-03-17 11:58:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:58,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:58:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:58,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:58:58,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:58,334 INFO L87 Difference]: Start difference. First operand 384 states and 521 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:58,872 INFO L93 Difference]: Finished difference Result 511 states and 562 transitions. [2025-03-17 11:58:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:58:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:58:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:58,875 INFO L225 Difference]: With dead ends: 511 [2025-03-17 11:58:58,875 INFO L226 Difference]: Without dead ends: 511 [2025-03-17 11:58:58,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:58,876 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 786 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:58,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 450 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:58:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-17 11:58:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 375. [2025-03-17 11:58:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 244 states have (on average 1.9795081967213115) internal successors, (483), 361 states have internal predecessors, (483), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:58:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 511 transitions. [2025-03-17 11:58:58,890 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 511 transitions. Word has length 10 [2025-03-17 11:58:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 511 transitions. [2025-03-17 11:58:58,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 511 transitions. [2025-03-17 11:58:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 11:58:58,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:58,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:58:58,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1201438769, now seen corresponding path program 1 times [2025-03-17 11:58:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:58,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030086685] [2025-03-17 11:58:58,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:58,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:58:58,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:58:58,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:58,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:59,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:59,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030086685] [2025-03-17 11:58:59,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030086685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:59,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:59,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:58:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774591028] [2025-03-17 11:58:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:59,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:58:59,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:59,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:58:59,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:59,173 INFO L87 Difference]: Start difference. First operand 375 states and 511 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:59,278 INFO L93 Difference]: Finished difference Result 397 states and 536 transitions. [2025-03-17 11:58:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:58:59,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 11:58:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:59,280 INFO L225 Difference]: With dead ends: 397 [2025-03-17 11:58:59,280 INFO L226 Difference]: Without dead ends: 397 [2025-03-17 11:58:59,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:58:59,280 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 35 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:59,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1843 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-17 11:58:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 383. [2025-03-17 11:58:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 251 states have (on average 1.956175298804781) internal successors, (491), 368 states have internal predecessors, (491), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:58:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 521 transitions. [2025-03-17 11:58:59,288 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 521 transitions. Word has length 19 [2025-03-17 11:58:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:59,288 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 521 transitions. [2025-03-17 11:58:59,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 521 transitions. [2025-03-17 11:58:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:58:59,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:59,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:58:59,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1004227121, now seen corresponding path program 1 times [2025-03-17 11:58:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574109531] [2025-03-17 11:58:59,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:59,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:58:59,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:58:59,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:59,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574109531] [2025-03-17 11:58:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574109531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:58:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899377537] [2025-03-17 11:58:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:59,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:58:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:59,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:58:59,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:58:59,614 INFO L87 Difference]: Start difference. First operand 383 states and 521 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:59,790 INFO L93 Difference]: Finished difference Result 390 states and 527 transitions. [2025-03-17 11:58:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:58:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:58:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:59,792 INFO L225 Difference]: With dead ends: 390 [2025-03-17 11:58:59,792 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 11:58:59,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:58:59,792 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 273 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:59,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1857 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 11:58:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2025-03-17 11:58:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 254 states have (on average 1.9448818897637796) internal successors, (494), 371 states have internal predecessors, (494), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:58:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2025-03-17 11:58:59,801 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 21 [2025-03-17 11:58:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:59,802 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2025-03-17 11:58:59,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2025-03-17 11:58:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 11:58:59,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:59,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:59,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:58:59,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:58:59,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:59,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1172864068, now seen corresponding path program 1 times [2025-03-17 11:58:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502173725] [2025-03-17 11:58:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:59,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:58:59,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:58:59,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:59,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502173725] [2025-03-17 11:59:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502173725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198376760] [2025-03-17 11:59:00,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:00,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:00,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:59:00,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:59:00,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:59:00,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:00,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:00,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 11:59:00,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:00,524 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-03-17 11:59:00,608 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 19 treesize of output 1 [2025-03-17 11:59:00,661 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-17 11:59:00,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-03-17 11:59:00,751 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 21 treesize of output 9 [2025-03-17 11:59:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:00,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:00,870 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 34 treesize of output 28 [2025-03-17 11:59:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198376760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:01,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2025-03-17 11:59:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970976266] [2025-03-17 11:59:01,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:59:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:01,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:59:01,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:59:01,039 INFO L87 Difference]: Start difference. First operand 386 states and 524 transitions. Second operand has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:59:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:01,934 INFO L93 Difference]: Finished difference Result 527 states and 579 transitions. [2025-03-17 11:59:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:59:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-03-17 11:59:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:01,936 INFO L225 Difference]: With dead ends: 527 [2025-03-17 11:59:01,936 INFO L226 Difference]: Without dead ends: 527 [2025-03-17 11:59:01,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:59:01,937 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1041 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:01,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1713 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:59:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-17 11:59:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 391. [2025-03-17 11:59:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 259 states have (on average 1.9227799227799227) internal successors, (498), 376 states have internal predecessors, (498), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:59:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 528 transitions. [2025-03-17 11:59:01,948 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 528 transitions. Word has length 36 [2025-03-17 11:59:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:01,949 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 528 transitions. [2025-03-17 11:59:01,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:59:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 528 transitions. [2025-03-17 11:59:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 11:59:01,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:01,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:01,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:02,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:02,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:59:02,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1172864067, now seen corresponding path program 1 times [2025-03-17 11:59:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:02,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107310759] [2025-03-17 11:59:02,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:02,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:59:02,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:59:02,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:02,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:03,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107310759] [2025-03-17 11:59:03,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107310759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738918363] [2025-03-17 11:59:03,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:03,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:03,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:03,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:03,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:59:03,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:59:03,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:59:03,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:03,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:03,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 11:59:03,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:03,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:59:03,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:03,528 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 11 treesize of output 7 [2025-03-17 11:59:03,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-17 11:59:03,579 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 13 treesize of output 9 [2025-03-17 11:59:03,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:03,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:59:03,706 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:59:03,707 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 15 treesize of output 15 [2025-03-17 11:59:03,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-03-17 11:59:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:03,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:04,253 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 34 treesize of output 28 [2025-03-17 11:59:04,271 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 76 treesize of output 70 [2025-03-17 11:59:04,381 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 104 treesize of output 98 [2025-03-17 11:59:04,602 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 44 treesize of output 38 [2025-03-17 11:59:04,730 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 44 treesize of output 38 [2025-03-17 11:59:04,861 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 44 treesize of output 38 [2025-03-17 11:59:04,985 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 44 treesize of output 38 [2025-03-17 11:59:05,097 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 44 treesize of output 38 [2025-03-17 11:59:05,221 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 44 treesize of output 38 [2025-03-17 11:59:05,335 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 44 treesize of output 38 [2025-03-17 11:59:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738918363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:05,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 6] total 30 [2025-03-17 11:59:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598850545] [2025-03-17 11:59:05,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:59:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:05,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:59:05,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:59:05,451 INFO L87 Difference]: Start difference. First operand 391 states and 528 transitions. Second operand has 31 states, 30 states have (on average 3.1) internal successors, (93), 29 states have internal predecessors, (93), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:59:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:08,801 INFO L93 Difference]: Finished difference Result 815 states and 933 transitions. [2025-03-17 11:59:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 11:59:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1) internal successors, (93), 29 states have internal predecessors, (93), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-17 11:59:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:08,804 INFO L225 Difference]: With dead ends: 815 [2025-03-17 11:59:08,805 INFO L226 Difference]: Without dead ends: 815 [2025-03-17 11:59:08,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=606, Invalid=2934, Unknown=0, NotChecked=0, Total=3540 [2025-03-17 11:59:08,806 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1570 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 3727 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 3959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:08,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 1997 Invalid, 3959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3727 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 11:59:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-17 11:59:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 390. [2025-03-17 11:59:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 259 states have (on average 1.9189189189189189) internal successors, (497), 375 states have internal predecessors, (497), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:59:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 527 transitions. [2025-03-17 11:59:08,823 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 527 transitions. Word has length 36 [2025-03-17 11:59:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:08,824 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 527 transitions. [2025-03-17 11:59:08,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1) internal successors, (93), 29 states have internal predecessors, (93), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:59:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 527 transitions. [2025-03-17 11:59:08,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 11:59:08,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:08,831 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:08,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:59:09,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 11:59:09,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:59:09,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:09,033 INFO L85 PathProgramCache]: Analyzing trace with hash 314756162, now seen corresponding path program 1 times [2025-03-17 11:59:09,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:09,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500140206] [2025-03-17 11:59:09,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:09,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 11:59:09,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 11:59:09,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:09,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 7 proven. 84 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2025-03-17 11:59:09,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:09,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500140206] [2025-03-17 11:59:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500140206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:09,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445561525] [2025-03-17 11:59:09,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:09,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:09,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:09,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:09,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:59:09,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 11:59:09,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 11:59:09,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:09,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:09,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 11:59:09,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-03-17 11:59:09,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:59:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445561525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:09,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:59:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-17 11:59:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567130005] [2025-03-17 11:59:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:09,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:09,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:09,561 INFO L87 Difference]: Start difference. First operand 390 states and 527 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 11:59:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:09,568 INFO L93 Difference]: Finished difference Result 391 states and 528 transitions. [2025-03-17 11:59:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 203 [2025-03-17 11:59:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:09,571 INFO L225 Difference]: With dead ends: 391 [2025-03-17 11:59:09,571 INFO L226 Difference]: Without dead ends: 391 [2025-03-17 11:59:09,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:09,572 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:09,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-17 11:59:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-03-17 11:59:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 260 states have (on average 1.9153846153846155) internal successors, (498), 376 states have internal predecessors, (498), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:59:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 528 transitions. [2025-03-17 11:59:09,580 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 528 transitions. Word has length 203 [2025-03-17 11:59:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:09,580 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 528 transitions. [2025-03-17 11:59:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 11:59:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 528 transitions. [2025-03-17 11:59:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 11:59:09,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:09,583 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:09,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:59:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:09,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:59:09,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1669959520, now seen corresponding path program 1 times [2025-03-17 11:59:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66975579] [2025-03-17 11:59:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:09,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 11:59:09,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 11:59:09,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:09,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 1 proven. 337 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-17 11:59:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66975579] [2025-03-17 11:59:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66975579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142693882] [2025-03-17 11:59:10,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:10,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:10,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:10,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:59:10,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 11:59:11,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 11:59:11,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:11,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:11,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:59:11,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:11,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:59:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 777 proven. 13 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-17 11:59:11,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:11,452 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 32 treesize of output 26 [2025-03-17 11:59:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 217 proven. 121 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-17 11:59:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142693882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:11,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 21 [2025-03-17 11:59:11,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100904537] [2025-03-17 11:59:11,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:11,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:59:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:11,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:59:11,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:59:11,516 INFO L87 Difference]: Start difference. First operand 391 states and 528 transitions. Second operand has 21 states, 20 states have (on average 5.0) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-17 11:59:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:12,064 INFO L93 Difference]: Finished difference Result 386 states and 520 transitions. [2025-03-17 11:59:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:59:12,064 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 229 [2025-03-17 11:59:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:12,066 INFO L225 Difference]: With dead ends: 386 [2025-03-17 11:59:12,066 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 11:59:12,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:59:12,067 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 578 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:12,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 3051 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:59:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 11:59:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2025-03-17 11:59:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 253 states have (on average 1.9328063241106719) internal successors, (489), 369 states have internal predecessors, (489), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:59:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 519 transitions. [2025-03-17 11:59:12,077 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 519 transitions. Word has length 229 [2025-03-17 11:59:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 519 transitions. [2025-03-17 11:59:12,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-17 11:59:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 519 transitions. [2025-03-17 11:59:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-17 11:59:12,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:12,080 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:12,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:12,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:12,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-17 11:59:12,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash 353514151, now seen corresponding path program 1 times [2025-03-17 11:59:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:12,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272300857] [2025-03-17 11:59:12,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:12,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:12,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-17 11:59:12,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-17 11:59:12,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:12,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 490 proven. 426 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-17 11:59:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272300857] [2025-03-17 11:59:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272300857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456291086] [2025-03-17 11:59:19,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:19,732 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:19,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:59:19,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-17 11:59:20,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-17 11:59:20,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:20,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:20,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 2205 conjuncts, 301 conjuncts are in the unsatisfiable core [2025-03-17 11:59:20,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:20,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:59:20,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2025-03-17 11:59:20,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:59:20,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 44 treesize of output 16 [2025-03-17 11:59:20,746 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-03-17 11:59:20,746 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 41 treesize of output 30 [2025-03-17 11:59:20,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-17 11:59:20,961 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-17 11:59:20,961 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 1 case distinctions, treesize of input 22 treesize of output 24 [2025-03-17 11:59:20,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2025-03-17 11:59:21,340 INFO L349 Elim1Store]: treesize reduction 187, result has 22.7 percent of original size [2025-03-17 11:59:21,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 57 treesize of output 67 [2025-03-17 11:59:21,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 42 [2025-03-17 11:59:21,599 INFO L349 Elim1Store]: treesize reduction 100, result has 35.1 percent of original size [2025-03-17 11:59:21,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 63 [2025-03-17 11:59:21,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 44 [2025-03-17 11:59:22,364 INFO L349 Elim1Store]: treesize reduction 152, result has 75.3 percent of original size [2025-03-17 11:59:22,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 203 treesize of output 643 [2025-03-17 11:59:22,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 188