./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:25:46,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:25:46,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:25:46,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:25:46,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:25:46,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:25:46,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:25:46,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:25:46,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:25:46,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:25:46,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:25:46,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:25:46,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:25:46,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:25:46,592 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:25:46,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:25:46,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:25:46,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:25:46,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:25:46,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:25:46,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:25:46,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:25:46,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:46,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:25:46,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:25:46,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:25:46,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:25:46,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:25:46,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:25:46,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:25:46,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:25:46,595 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2025-02-08 06:25:46,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:25:46,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:25:46,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:25:46,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:25:46,846 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:25:46,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2025-02-08 06:25:48,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f12d8c3d/01cc4328873b4b339d51213a024601fd/FLAG123c8c526 [2025-02-08 06:25:48,326 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:25:48,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2025-02-08 06:25:48,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f12d8c3d/01cc4328873b4b339d51213a024601fd/FLAG123c8c526 [2025-02-08 06:25:48,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f12d8c3d/01cc4328873b4b339d51213a024601fd [2025-02-08 06:25:48,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:25:48,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:25:48,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:48,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:25:48,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:25:48,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:48,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253b3e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48, skipping insertion in model container [2025-02-08 06:25:48,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:48,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:25:48,864 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:25:48,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:48,891 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:25:48,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:48,957 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:25:48,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48 WrapperNode [2025-02-08 06:25:48,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:48,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:48,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:25:48,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:25:48,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:48,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:48,998 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-02-08 06:25:49,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:49,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:25:49,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:25:49,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:25:49,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,036 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2025-02-08 06:25:49,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:25:49,055 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:25:49,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:25:49,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:25:49,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (1/1) ... [2025-02-08 06:25:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:49,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:49,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:25:49,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:25:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:25:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:25:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:25:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:25:49,186 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:25:49,187 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:25:49,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-02-08 06:25:49,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L584-1: assume 0 != main_#t~nondet16#1;havoc main_#t~nondet16#1; [2025-02-08 06:25:49,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L584-1: assume !(0 != main_#t~nondet16#1);havoc main_#t~nondet16#1; [2025-02-08 06:25:49,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; [2025-02-08 06:25:49,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578-1: SUMMARY for call write~$Pointer$#1(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4); srcloc: null [2025-02-08 06:25:49,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578-1: assume !(1 == #valid[append_~node~0#1.base]); [2025-02-08 06:25:49,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578-1: assume !(4 + append_~node~0#1.offset <= #length[append_~node~0#1.base] && 0 <= append_~node~0#1.offset); [2025-02-08 06:25:49,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578-2: append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem7#1.base, create_data_#t~mem7#1.offset, create_data_#t~nondet8#1, create_data_#t~post9#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset;assume { :end_inline_create_data } true; [2025-02-08 06:25:49,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L579: havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;havoc append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;assume { :end_inline_append } true;havoc main_#t~nondet16#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647; [2025-02-08 06:25:49,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L579-1: SUMMARY for call write~$Pointer$#2(append_~node~0#1.base, append_~node~0#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, 4); srcloc: null [2025-02-08 06:25:49,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L579-1: assume !(1 == #valid[append_~pointerToList#1.base]); [2025-02-08 06:25:49,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L579-1: assume !(4 + append_~pointerToList#1.offset <= #length[append_~pointerToList#1.base] && 0 <= append_~pointerToList#1.offset); [2025-02-08 06:25:49,512 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-02-08 06:25:49,512 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:25:49,520 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:25:49,522 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:25:49,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:49 BoogieIcfgContainer [2025-02-08 06:25:49,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:25:49,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:25:49,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:25:49,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:25:49,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:25:48" (1/3) ... [2025-02-08 06:25:49,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555466d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:49, skipping insertion in model container [2025-02-08 06:25:49,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:48" (2/3) ... [2025-02-08 06:25:49,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555466d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:49, skipping insertion in model container [2025-02-08 06:25:49,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:49" (3/3) ... [2025-02-08 06:25:49,531 INFO L128 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2025-02-08 06:25:49,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:25:49,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-1.i that has 1 procedures, 91 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2025-02-08 06:25:49,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:25:49,576 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;@7036f668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:25:49,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 06:25:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 90 states have internal predecessors, (96), 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-02-08 06:25:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:25:49,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:49,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:25:49,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:49,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash 140941, now seen corresponding path program 1 times [2025-02-08 06:25:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131392171] [2025-02-08 06:25:49,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:49,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:25:49,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:25:49,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:49,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131392171] [2025-02-08 06:25:49,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131392171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:49,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:49,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:49,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989968973] [2025-02-08 06:25:49,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:49,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:49,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:49,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:49,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:49,883 INFO L87 Difference]: Start difference. First operand has 91 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 90 states have internal predecessors, (96), 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) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-02-08 06:25:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:49,951 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-02-08 06:25:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:25:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-08 06:25:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:49,957 INFO L225 Difference]: With dead ends: 32 [2025-02-08 06:25:49,958 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 06:25:49,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:49,961 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:49,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 06:25:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 06:25:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 29 states have internal predecessors, (31), 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-02-08 06:25:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-08 06:25:49,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 3 [2025-02-08 06:25:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:49,983 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-08 06:25:49,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-02-08 06:25:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-08 06:25:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:25:49,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:49,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:25:49,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:25:49,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:49,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash 140942, now seen corresponding path program 1 times [2025-02-08 06:25:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:49,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137635135] [2025-02-08 06:25:49,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:49,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:25:50,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:25:50,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137635135] [2025-02-08 06:25:50,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137635135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:50,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607464990] [2025-02-08 06:25:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:50,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:50,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:50,152 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-02-08 06:25:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:50,194 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2025-02-08 06:25:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:25:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-08 06:25:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:50,195 INFO L225 Difference]: With dead ends: 29 [2025-02-08 06:25:50,195 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 06:25:50,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:50,197 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:50,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 06:25:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 06:25:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 28 states have internal predecessors, (30), 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-02-08 06:25:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-02-08 06:25:50,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 3 [2025-02-08 06:25:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:50,199 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-02-08 06:25:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-02-08 06:25:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-02-08 06:25:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:25:50,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:50,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:25:50,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:25:50,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash 4369245, now seen corresponding path program 1 times [2025-02-08 06:25:50,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:50,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858303135] [2025-02-08 06:25:50,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:50,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:25:50,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:25:50,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858303135] [2025-02-08 06:25:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858303135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519516566] [2025-02-08 06:25:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:50,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:50,251 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:25:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:50,273 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-02-08 06:25:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:50,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 06:25:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:50,277 INFO L225 Difference]: With dead ends: 28 [2025-02-08 06:25:50,277 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 06:25:50,277 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-02-08 06:25:50,278 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:50,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 06:25:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-08 06:25:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 27 states have internal predecessors, (29), 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-02-08 06:25:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-02-08 06:25:50,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2025-02-08 06:25:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:50,282 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-02-08 06:25:50,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:25:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-02-08 06:25:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:25:50,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:50,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:25:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:25:50,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:50,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:50,286 INFO L85 PathProgramCache]: Analyzing trace with hash 4369246, now seen corresponding path program 1 times [2025-02-08 06:25:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310008607] [2025-02-08 06:25:50,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:50,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:25:50,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:25:50,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310008607] [2025-02-08 06:25:50,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310008607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:50,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:50,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273436423] [2025-02-08 06:25:50,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:50,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:50,343 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:25:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:50,366 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-02-08 06:25:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:50,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 06:25:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:50,367 INFO L225 Difference]: With dead ends: 27 [2025-02-08 06:25:50,367 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 06:25:50,367 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-02-08 06:25:50,368 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:50,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 06:25:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-08 06:25:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 26 states have internal predecessors, (28), 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-02-08 06:25:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-02-08 06:25:50,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 4 [2025-02-08 06:25:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:50,370 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-02-08 06:25:50,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:25:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-02-08 06:25:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:25:50,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:50,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:25:50,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2117466778, now seen corresponding path program 1 times [2025-02-08 06:25:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651700109] [2025-02-08 06:25:50,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:50,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:25:50,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:25:50,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651700109] [2025-02-08 06:25:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651700109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936862795] [2025-02-08 06:25:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:50,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:50,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:50,448 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-08 06:25:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:50,482 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-02-08 06:25:50,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:50,482 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), 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 8 [2025-02-08 06:25:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:50,483 INFO L225 Difference]: With dead ends: 23 [2025-02-08 06:25:50,483 INFO L226 Difference]: Without dead ends: 23 [2025-02-08 06:25:50,483 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-02-08 06:25:50,483 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:50,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-08 06:25:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-08 06:25:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 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-02-08 06:25:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-02-08 06:25:50,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 8 [2025-02-08 06:25:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:50,486 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-02-08 06:25:50,486 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), 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-02-08 06:25:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-02-08 06:25:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:25:50,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:50,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:50,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:25:50,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:50,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2117466777, now seen corresponding path program 1 times [2025-02-08 06:25:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:50,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712201642] [2025-02-08 06:25:50,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:50,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:25:50,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:25:50,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712201642] [2025-02-08 06:25:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712201642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:50,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:50,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95630180] [2025-02-08 06:25:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:50,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:50,536 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-08 06:25:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:50,559 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-02-08 06:25:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:50,559 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), 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 8 [2025-02-08 06:25:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:50,559 INFO L225 Difference]: With dead ends: 19 [2025-02-08 06:25:50,560 INFO L226 Difference]: Without dead ends: 16 [2025-02-08 06:25:50,560 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-02-08 06:25:50,560 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:50,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-08 06:25:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-08 06:25:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-02-08 06:25:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-02-08 06:25:50,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2025-02-08 06:25:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:50,562 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-02-08 06:25:50,562 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), 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-02-08 06:25:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-02-08 06:25:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:25:50,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:50,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:25:50,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash -461763844, now seen corresponding path program 1 times [2025-02-08 06:25:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717351063] [2025-02-08 06:25:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:50,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:25:50,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:25:50,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717351063] [2025-02-08 06:25:50,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717351063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:50,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:50,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734668280] [2025-02-08 06:25:50,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:50,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:50,700 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-02-08 06:25:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:50,746 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-02-08 06:25:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:50,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-02-08 06:25:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:50,747 INFO L225 Difference]: With dead ends: 21 [2025-02-08 06:25:50,748 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:25:50,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:50,748 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:50,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:25:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-02-08 06:25:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-02-08 06:25:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-02-08 06:25:50,751 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2025-02-08 06:25:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:50,751 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-08 06:25:50,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-02-08 06:25:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-02-08 06:25:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:25:50,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:50,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:50,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:25:50,752 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash -461763843, now seen corresponding path program 1 times [2025-02-08 06:25:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:50,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887842193] [2025-02-08 06:25:50,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:50,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:25:50,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:25:50,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887842193] [2025-02-08 06:25:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887842193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:25:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153232183] [2025-02-08 06:25:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:25:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:25:50,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:50,924 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-02-08 06:25:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:50,991 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-02-08 06:25:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:25:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2025-02-08 06:25:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:50,992 INFO L225 Difference]: With dead ends: 20 [2025-02-08 06:25:50,992 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 06:25:50,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:25:50,992 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:50,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 06:25:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 06:25:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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-02-08 06:25:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-02-08 06:25:50,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2025-02-08 06:25:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:50,994 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-02-08 06:25:50,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-02-08 06:25:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-02-08 06:25:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:25:50,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:50,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:50,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:25:50,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:50,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1726137232, now seen corresponding path program 1 times [2025-02-08 06:25:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:50,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288234226] [2025-02-08 06:25:50,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:51,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:51,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:51,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:51,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288234226] [2025-02-08 06:25:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288234226] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945084253] [2025-02-08 06:25:51,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:51,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:51,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:51,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:51,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:25:51,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:51,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:51,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:51,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:51,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:25:51,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:51,326 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-02-08 06:25:51,355 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:25:51,355 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 17 treesize of output 21 [2025-02-08 06:25:51,402 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-02-08 06:25:51,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:51,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 06:25:51,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 06:25:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:25:51,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:51,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_136 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_136) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 06:25:51,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:51,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 06:25:51,629 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 40 treesize of output 28 [2025-02-08 06:25:51,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-08 06:25:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:25:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945084253] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:51,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2025-02-08 06:25:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141950008] [2025-02-08 06:25:51,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:51,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:25:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:51,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:25:51,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=4, NotChecked=26, Total=240 [2025-02-08 06:25:51,688 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 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-02-08 06:25:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:51,740 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-02-08 06:25:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:25:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 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 18 [2025-02-08 06:25:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:51,741 INFO L225 Difference]: With dead ends: 19 [2025-02-08 06:25:51,741 INFO L226 Difference]: Without dead ends: 19 [2025-02-08 06:25:51,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=4, NotChecked=26, Total=240 [2025-02-08 06:25:51,742 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:51,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2025-02-08 06:25:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-08 06:25:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-08 06:25:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-02-08 06:25:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-02-08 06:25:51,743 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2025-02-08 06:25:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:51,744 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-02-08 06:25:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 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-02-08 06:25:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-02-08 06:25:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:25:51,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:51,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:51,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:25:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:51,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1726137231, now seen corresponding path program 1 times [2025-02-08 06:25:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053917968] [2025-02-08 06:25:51,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:51,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:51,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:51,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:51,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053917968] [2025-02-08 06:25:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053917968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329130957] [2025-02-08 06:25:52,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:52,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:52,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:25:52,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:52,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:52,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:52,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:52,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:25:52,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:52,404 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-02-08 06:25:52,424 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-02-08 06:25:52,435 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:25:52,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:25:52,466 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-02-08 06:25:52,471 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-02-08 06:25:52,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:52,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 06:25:52,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:25:52,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 06:25:52,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:25:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:52,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:52,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_194 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_194) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_194) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_195) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2025-02-08 06:25:52,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_194 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_194) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_194) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_195) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2025-02-08 06:25:52,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:52,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-02-08 06:25:52,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:52,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-02-08 06:25:52,900 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 62 treesize of output 50 [2025-02-08 06:25:52,904 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 96 treesize of output 78 [2025-02-08 06:25:52,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 06:25:52,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:25:52,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:52,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 06:25:52,923 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:25:52,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 06:25:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:25:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329130957] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:52,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2025-02-08 06:25:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178613967] [2025-02-08 06:25:52,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:25:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:52,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:25:52,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=8, NotChecked=82, Total=552 [2025-02-08 06:25:52,968 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 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-02-08 06:25:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:53,353 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-02-08 06:25:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:25:53,354 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 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 18 [2025-02-08 06:25:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:53,354 INFO L225 Difference]: With dead ends: 29 [2025-02-08 06:25:53,354 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 06:25:53,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=755, Unknown=9, NotChecked=118, Total=1056 [2025-02-08 06:25:53,357 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:53,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 27 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 18 Unknown, 55 Unchecked, 0.1s Time] [2025-02-08 06:25:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 06:25:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 06:25:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-02-08 06:25:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-02-08 06:25:53,360 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 18 [2025-02-08 06:25:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:53,360 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-02-08 06:25:53,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 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-02-08 06:25:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-02-08 06:25:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:25:53,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:53,360 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:53,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:25:53,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:53,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:53,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2021508081, now seen corresponding path program 2 times [2025-02-08 06:25:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:53,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441541815] [2025-02-08 06:25:53,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:25:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:53,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 06:25:53,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:25:53,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:25:53,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441541815] [2025-02-08 06:25:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441541815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536910721] [2025-02-08 06:25:54,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:25:54,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:54,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:54,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:25:54,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 06:25:54,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:25:54,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:25:54,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:54,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 06:25:54,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:54,166 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-02-08 06:25:54,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:25:54,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:25:54,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:25:54,188 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-02-08 06:25:54,193 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-02-08 06:25:54,267 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:54,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 06:25:54,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:25:54,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:54,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 06:25:54,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:25:54,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:54,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 06:25:54,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:25:54,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 06:25:54,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:25:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:54,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:54,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_282) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_283 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4)))))) is different from false [2025-02-08 06:25:54,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_281))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_280) .cse1 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_282) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_280) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_281) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))))) is different from false [2025-02-08 06:25:54,752 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_280) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_281) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_281))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_280) .cse3 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_282) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2025-02-08 06:25:54,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_280) .cse2 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_282) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_280) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_281) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)))))) is different from false [2025-02-08 06:25:54,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_278))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_279) .cse1 v_ArrVal_280) .cse2 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_282) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_278))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_279) .cse6 v_ArrVal_280) (select (select (store .cse7 .cse6 v_ArrVal_281) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_283))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) is different from false [2025-02-08 06:25:54,815 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse4 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_278))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse1 v_ArrVal_280) .cse2 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 16) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_282) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_278))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse7 v_ArrVal_280) (select (select (store .cse8 .cse7 v_ArrVal_281) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_283))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 12)))))) is different from false [2025-02-08 06:25:54,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_278))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse1 v_ArrVal_280) .cse2 v_ArrVal_283) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 16) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_282) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_278))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse6 v_ArrVal_280) (select (select (store .cse7 .cse6 v_ArrVal_281) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_283))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)))))) is different from false [2025-02-08 06:25:54,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:54,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2025-02-08 06:25:54,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:54,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2025-02-08 06:25:54,860 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 738 treesize of output 636 [2025-02-08 06:25:54,875 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 665 treesize of output 629 [2025-02-08 06:25:54,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2025-02-08 06:25:54,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 105 [2025-02-08 06:25:54,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 93 [2025-02-08 06:25:54,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2025-02-08 06:25:54,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-02-08 06:25:54,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:54,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2025-02-08 06:25:54,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:54,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2025-02-08 06:25:54,927 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:25:54,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 310 [2025-02-08 06:25:54,933 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:25:54,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-02-08 06:25:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2025-02-08 06:25:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536910721] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:54,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 34 [2025-02-08 06:25:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834411414] [2025-02-08 06:25:54,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:54,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 06:25:54,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:54,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 06:25:54,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=621, Unknown=18, NotChecked=406, Total=1190 [2025-02-08 06:25:54,976 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 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-02-08 06:25:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:55,605 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2025-02-08 06:25:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:25:55,605 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 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 28 [2025-02-08 06:25:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:55,605 INFO L225 Difference]: With dead ends: 39 [2025-02-08 06:25:55,607 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 06:25:55,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=1346, Unknown=21, NotChecked=588, Total=2256 [2025-02-08 06:25:55,608 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:55,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 59 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 24 Unknown, 257 Unchecked, 0.2s Time] [2025-02-08 06:25:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 06:25:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-08 06:25:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-02-08 06:25:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2025-02-08 06:25:55,612 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 28 [2025-02-08 06:25:55,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:55,612 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2025-02-08 06:25:55,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 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-02-08 06:25:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2025-02-08 06:25:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:25:55,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:55,613 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:55,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:25:55,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:55,814 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:25:55,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1401230479, now seen corresponding path program 3 times [2025-02-08 06:25:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360977871] [2025-02-08 06:25:55,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:25:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:55,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-02-08 06:25:55,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:25:55,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 06:25:55,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360977871] [2025-02-08 06:25:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360977871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212367239] [2025-02-08 06:25:56,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:25:56,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:56,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:56,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:56,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:25:56,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-02-08 06:25:56,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:25:56,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 06:25:56,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:56,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 06:25:56,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:56,856 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-02-08 06:25:56,860 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-02-08 06:25:56,902 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:25:56,902 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 14 treesize of output 13 [2025-02-08 06:25:56,912 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:25:56,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:25:56,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:25:56,952 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-02-08 06:25:57,067 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:57,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-02-08 06:25:57,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:57,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:25:57,164 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:57,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-02-08 06:25:57,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:57,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:25:57,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:57,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-02-08 06:25:57,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:57,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:25:57,389 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:57,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2025-02-08 06:25:57,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:57,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2025-02-08 06:25:57,508 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:57,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-02-08 06:25:57,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:57,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:25:57,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:25:57,570 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 7 treesize of output 3 [2025-02-08 06:25:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:57,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:59,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_393))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_392)) (.cse0 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse0) (+ .cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse8 (store .cse2 .cse0 v_ArrVal_395))) (let ((.cse10 (+ .cse1 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8))) (or (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse6 (store .cse9 .cse0 v_ArrVal_394))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_396)) (.cse4 (select (select (store .cse6 .cse7 v_ArrVal_397) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse4) (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 16)) (forall ((v_ArrVal_399 (Array Int Int))) (<= 0 (+ .cse1 16 (select (select (store .cse5 .cse4 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) (not (= v_ArrVal_396 (store v_ArrVal_395 .cse10 (select v_ArrVal_396 .cse10)))))) (< .cse10 0))))))))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_393))) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_392)) (.cse11 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse11) (+ .cse1 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse16 (store .cse12 .cse11 v_ArrVal_395))) (let ((.cse19 (+ .cse1 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8))) (or (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse18 (store .cse20 .cse11 v_ArrVal_394))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_397))) (let ((.cse14 (store .cse16 .cse17 v_ArrVal_396)) (.cse13 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse13) (+ (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 16)) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (<= (+ .cse1 20 (select (select (store .cse14 .cse13 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse15 .cse13 v_ArrVal_398) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (not (= (store (select .cse16 .cse17) .cse19 (select v_ArrVal_396 .cse19)) v_ArrVal_396)))))) (< .cse19 0))))))))))) is different from false [2025-02-08 06:25:59,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_393))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_392)) (.cse0 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse5 (store .cse1 .cse0 v_ArrVal_395))) (let ((.cse4 (+ .cse3 8 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (or (< .cse4 0) (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse10 (store .cse11 .cse0 v_ArrVal_394))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (not (= v_ArrVal_396 (store (select .cse5 .cse6) .cse4 (select v_ArrVal_396 .cse4)))) (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_397))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse7 (store .cse5 .cse6 v_ArrVal_396))) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (<= (+ (select (select (store .cse7 .cse8 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_398) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| .cse8) (+ .cse3 16 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))))))))))))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_393))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse21 (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_392))) (or (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse15 (store .cse21 .cse19 v_ArrVal_395))) (let ((.cse20 (+ .cse3 8 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (or (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse17 (store .cse18 .cse19 v_ArrVal_394))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse14 (select (select (store .cse17 .cse16 v_ArrVal_397) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse13 (store .cse15 .cse16 v_ArrVal_396))) (or (forall ((v_ArrVal_399 (Array Int Int))) (<= 0 (+ (select (select (store .cse13 .cse14 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16))) (< (select |c_#length| .cse14) (+ .cse3 16 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (not (= v_ArrVal_396 (store v_ArrVal_395 .cse20 (select v_ArrVal_396 .cse20)))))) (< .cse20 0))))) (< (select |c_#length| .cse19) (+ (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8))))))))) is different from false [2025-02-08 06:26:00,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_390))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse11 (store .cse13 .cse12 v_ArrVal_393))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_391) .cse12 v_ArrVal_392)) (.cse0 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse7 (store .cse1 .cse0 v_ArrVal_395))) (let ((.cse10 (+ .cse3 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (or (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse9 (store .cse11 .cse0 v_ArrVal_394))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_397))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse4 (store .cse7 .cse8 v_ArrVal_396))) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_398) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| .cse5) (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20)))))) (not (= v_ArrVal_396 (store (select .cse7 .cse8) .cse10 (select v_ArrVal_396 .cse10)))))))) (< .cse10 0))))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_390))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse21 (store .cse24 .cse23 v_ArrVal_393))) (let ((.cse15 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_391) .cse23 v_ArrVal_392)) (.cse14 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse14) (+ (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse20 (store .cse15 .cse14 v_ArrVal_395))) (let ((.cse22 (+ .cse3 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (or (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse18 (store .cse21 .cse14 v_ArrVal_394))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse17 (store .cse20 .cse19 v_ArrVal_396)) (.cse16 (select (select (store .cse18 .cse19 v_ArrVal_397) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse16) (+ (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20)) (forall ((v_ArrVal_399 (Array Int Int))) (<= 0 (+ (select (select (store .cse17 .cse16 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20)))))))) (not (= (store v_ArrVal_395 .cse22 (select v_ArrVal_396 .cse22)) v_ArrVal_396)))) (< .cse22 0))))))))))))) is different from false [2025-02-08 06:26:00,212 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_390))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse9 (store .cse14 .cse13 v_ArrVal_393))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (.cse11 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_391) .cse13 v_ArrVal_392))) (or (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_395))) (let ((.cse0 (+ (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 12))) (or (< .cse0 0) (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_394))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_397))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_396)) (.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse1) (+ .cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 20)) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (<= (+ (select (select (store .cse3 .cse1 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 24) (select |c_#length| (select (select (store .cse5 .cse1 v_ArrVal_398) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (not (= v_ArrVal_396 (store (select .cse6 .cse7) .cse0 (select v_ArrVal_396 .cse0)))))))))))) (< (select |c_#length| .cse10) (+ .cse2 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 12)))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_390))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse23 (store .cse25 .cse24 v_ArrVal_393))) (let ((.cse16 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_391) .cse24 v_ArrVal_392)) (.cse15 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse15) (+ .cse2 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 12)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse22 (store .cse16 .cse15 v_ArrVal_395))) (let ((.cse17 (+ (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 12))) (or (< .cse17 0) (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse20 (store .cse23 .cse15 v_ArrVal_394))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse19 (store .cse22 .cse21 v_ArrVal_396)) (.cse18 (select (select (store .cse20 .cse21 v_ArrVal_397) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse18) (+ .cse2 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 20)) (forall ((v_ArrVal_399 (Array Int Int))) (<= 0 (+ (select (select (store .cse19 .cse18 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 20)))))))) (not (= v_ArrVal_396 (store v_ArrVal_395 .cse17 (select v_ArrVal_396 .cse17))))))))))))))))))) is different from false [2025-02-08 06:26:00,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_390))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse9 (store .cse12 .cse11 v_ArrVal_393))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_391) .cse11 v_ArrVal_392)) (.cse0 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse6 (store .cse1 .cse0 v_ArrVal_395))) (let ((.cse3 (+ (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (or (< .cse3 0) (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_394))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse5 (select (select (store .cse8 .cse7 v_ArrVal_397) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse4 (store .cse6 .cse7 v_ArrVal_396))) (or (forall ((v_ArrVal_399 (Array Int Int))) (<= 0 (+ (select (select (store .cse4 .cse5 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20))) (< (select |c_#length| .cse5) (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20))))))) (not (= v_ArrVal_396 (store v_ArrVal_395 .cse3 (select v_ArrVal_396 .cse3)))))))))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_390))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse22 (store .cse24 .cse23 v_ArrVal_393))) (let ((.cse14 (store (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_391) .cse23 v_ArrVal_392)) (.cse13 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse13) (+ (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)) (forall ((v_ArrVal_395 (Array Int Int))) (let ((.cse16 (store .cse14 .cse13 v_ArrVal_395))) (let ((.cse15 (+ (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (or (< .cse15 0) (forall ((v_ArrVal_394 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse21 (store .cse22 .cse13 v_ArrVal_394))) (let ((.cse17 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (not (= v_ArrVal_396 (store (select .cse16 .cse17) .cse15 (select v_ArrVal_396 .cse15)))) (forall ((v_ArrVal_397 (Array Int Int))) (let ((.cse20 (store .cse21 .cse17 v_ArrVal_397))) (let ((.cse19 (store .cse16 .cse17 v_ArrVal_396)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse18) (+ (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20)) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (<= (+ (select (select (store .cse19 .cse18 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse20 .cse18 v_ArrVal_398) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))))))))))))))))))) is different from false [2025-02-08 06:26:00,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:00,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1070 treesize of output 1020 [2025-02-08 06:26:00,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:00,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1010 treesize of output 600 [2025-02-08 06:26:00,578 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 72529495 treesize of output 61025377 [2025-02-08 06:26:01,149 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 272551 treesize of output 269137 [2025-02-08 06:26:01,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 558 treesize of output 522 [2025-02-08 06:26:01,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 522 treesize of output 462 [2025-02-08 06:26:01,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 235 [2025-02-08 06:26:01,370 INFO L349 Elim1Store]: treesize reduction 98, result has 55.3 percent of original size [2025-02-08 06:26:01,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 751 treesize of output 944 [2025-02-08 06:26:01,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 769 treesize of output 657 [2025-02-08 06:26:01,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 239 [2025-02-08 06:26:01,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 514 treesize of output 462 [2025-02-08 06:26:01,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 311 [2025-02-08 06:26:01,712 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:26:01,715 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:26:08,563 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 576 DAG size of output: 160 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-08 06:26:08,564 INFO L349 Elim1Store]: treesize reduction 2302, result has 12.2 percent of original size [2025-02-08 06:26:08,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 18 new quantified variables, introduced 101 case distinctions, treesize of input 1717 treesize of output 4043 [2025-02-08 06:26:26,698 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:26:26,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2025-02-08 06:26:27,295 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:26:27,296 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:26:27,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:27,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2025-02-08 06:26:29,715 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:26:29,716 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:26:29,751 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-02-08 06:26:29,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 68 [2025-02-08 06:26:37,960 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 578 DAG size of output: 205 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-08 06:26:37,960 INFO L349 Elim1Store]: treesize reduction 3025, result has 16.5 percent of original size [2025-02-08 06:26:37,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 10 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 15 new quantified variables, introduced 91 case distinctions, treesize of input 3096 treesize of output 5109