./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/complex_data_creation_test01-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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:19:24,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:19:25,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:19:25,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:19:25,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:19:25,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:19:25,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:19:25,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:19:25,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:19:25,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:19:25,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:19:25,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:19:25,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:19:25,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:19:25,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:19:25,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:19:25,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:19:25,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:19:25,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:19:25,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:19:25,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:19:25,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:19:25,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:19:25,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:19:25,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:19:25,055 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2025-02-06 10:19:25,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:19:25,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:19:25,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:19:25,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:19:25,240 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:19:25,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-02-06 10:19:26,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9a03cee/c95b2f83e7a247f2ab3e4602874dfc2a/FLAGea235c47e [2025-02-06 10:19:26,778 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:19:26,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-02-06 10:19:26,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9a03cee/c95b2f83e7a247f2ab3e4602874dfc2a/FLAGea235c47e [2025-02-06 10:19:26,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9a03cee/c95b2f83e7a247f2ab3e4602874dfc2a [2025-02-06 10:19:26,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:19:26,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:19:26,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:19:26,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:19:26,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:19:26,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:19:26" (1/1) ... [2025-02-06 10:19:26,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333f7a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:26, skipping insertion in model container [2025-02-06 10:19:26,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:19:26" (1/1) ... [2025-02-06 10:19:26,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:19:26,958 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-06 10:19:26,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:19:26,986 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:19:27,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:19:27,058 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:19:27,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27 WrapperNode [2025-02-06 10:19:27,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:19:27,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:19:27,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:19:27,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:19:27,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,082 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-02-06 10:19:27,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:19:27,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:19:27,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:19:27,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:19:27,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,104 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2025-02-06 10:19:27,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:19:27,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:19:27,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:19:27,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:19:27,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (1/1) ... [2025-02-06 10:19:27,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:19:27,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:27,140 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-06 10:19:27,144 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-06 10:19:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-02-06 10:19:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:19:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:19:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:19:27,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:19:27,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:19:27,235 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:19:27,432 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-02-06 10:19:27,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: 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-06 10:19:27,610 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-02-06 10:19:27,610 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:19:27,623 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:19:27,625 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:19:27,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:19:27 BoogieIcfgContainer [2025-02-06 10:19:27,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:19:27,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:19:27,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:19:27,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:19:27,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:19:26" (1/3) ... [2025-02-06 10:19:27,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc9d47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:19:27, skipping insertion in model container [2025-02-06 10:19:27,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:27" (2/3) ... [2025-02-06 10:19:27,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc9d47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:19:27, skipping insertion in model container [2025-02-06 10:19:27,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:19:27" (3/3) ... [2025-02-06 10:19:27,634 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2025-02-06 10:19:27,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:19:27,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.i that has 2 procedures, 195 locations, 1 initial locations, 4 loop locations, and 92 error locations. [2025-02-06 10:19:27,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:19:27,692 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;@4b8b32ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:19:27,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-02-06 10:19:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 99 states have (on average 2.080808080808081) internal successors, (206), 191 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:19:27,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:27,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:19:27,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:27,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 7356318, now seen corresponding path program 1 times [2025-02-06 10:19:27,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:27,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892964257] [2025-02-06 10:19:27,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:27,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:27,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:19:27,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:19:27,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:27,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:27,887 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-06 10:19:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:27,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892964257] [2025-02-06 10:19:27,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892964257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:27,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180597701] [2025-02-06 10:19:27,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:27,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:27,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:27,907 INFO L87 Difference]: Start difference. First operand has 195 states, 99 states have (on average 2.080808080808081) internal successors, (206), 191 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-06 10:19:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:28,102 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2025-02-06 10:19:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:19:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-06 10:19:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:28,110 INFO L225 Difference]: With dead ends: 189 [2025-02-06 10:19:28,111 INFO L226 Difference]: Without dead ends: 187 [2025-02-06 10:19:28,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:28,115 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 77 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:28,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 321 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-06 10:19:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-06 10:19:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 1.989795918367347) internal successors, (195), 183 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2025-02-06 10:19:28,159 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 4 [2025-02-06 10:19:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:28,160 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2025-02-06 10:19:28,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-06 10:19:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2025-02-06 10:19:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:19:28,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:28,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:19:28,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:19:28,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 7356319, now seen corresponding path program 1 times [2025-02-06 10:19:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145177727] [2025-02-06 10:19:28,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:28,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:19:28,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:19:28,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:28,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:28,303 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-06 10:19:28,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:28,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145177727] [2025-02-06 10:19:28,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145177727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:28,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:28,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620876931] [2025-02-06 10:19:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:28,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:28,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:28,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:28,305 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-06 10:19:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:28,555 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2025-02-06 10:19:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:19:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-06 10:19:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:28,558 INFO L225 Difference]: With dead ends: 203 [2025-02-06 10:19:28,558 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 10:19:28,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:28,559 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 28 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:28,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 358 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 10:19:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2025-02-06 10:19:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.9611650485436893) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2025-02-06 10:19:28,570 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 4 [2025-02-06 10:19:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:28,571 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2025-02-06 10:19:28,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-06 10:19:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2025-02-06 10:19:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:19:28,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:28,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:19:28,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:19:28,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 228046028, now seen corresponding path program 1 times [2025-02-06 10:19:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001452552] [2025-02-06 10:19:28,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:28,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:19:28,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:19:28,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:28,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:28,623 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-06 10:19:28,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:28,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001452552] [2025-02-06 10:19:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001452552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:28,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:28,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:28,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061388090] [2025-02-06 10:19:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:28,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:28,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:28,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:28,627 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 10:19:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:28,726 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2025-02-06 10:19:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:28,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 10:19:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:28,727 INFO L225 Difference]: With dead ends: 190 [2025-02-06 10:19:28,728 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 10:19:28,728 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-06 10:19:28,728 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:28,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 279 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 10:19:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-02-06 10:19:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 103 states have (on average 1.9320388349514563) internal successors, (199), 186 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2025-02-06 10:19:28,734 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 5 [2025-02-06 10:19:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2025-02-06 10:19:28,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 10:19:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2025-02-06 10:19:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:19:28,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:28,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:19:28,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:19:28,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:28,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash 228046029, now seen corresponding path program 1 times [2025-02-06 10:19:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987638388] [2025-02-06 10:19:28,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:28,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:19:28,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:19:28,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:28,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:28,782 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-06 10:19:28,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987638388] [2025-02-06 10:19:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987638388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:28,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:28,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:28,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818481772] [2025-02-06 10:19:28,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:28,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:28,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:28,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:28,786 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 10:19:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:28,875 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2025-02-06 10:19:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:28,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 10:19:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:28,876 INFO L225 Difference]: With dead ends: 188 [2025-02-06 10:19:28,876 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 10:19:28,876 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-06 10:19:28,877 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:28,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 10:19:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-06 10:19:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.9029126213592233) internal successors, (196), 184 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2025-02-06 10:19:28,885 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 5 [2025-02-06 10:19:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:28,886 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2025-02-06 10:19:28,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 10:19:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2025-02-06 10:19:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:19:28,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:28,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:28,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:19:28,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:28,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1724965913, now seen corresponding path program 1 times [2025-02-06 10:19:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985939274] [2025-02-06 10:19:28,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:28,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:19:28,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:19:28,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:28,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:28,968 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-06 10:19:28,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985939274] [2025-02-06 10:19:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985939274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:28,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:19:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089224115] [2025-02-06 10:19:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:28,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:28,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:28,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:28,969 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-06 10:19:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:29,065 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2025-02-06 10:19:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-02-06 10:19:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:29,066 INFO L225 Difference]: With dead ends: 197 [2025-02-06 10:19:29,066 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 10:19:29,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:19:29,067 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:29,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 722 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 10:19:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2025-02-06 10:19:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.8942307692307692) internal successors, (197), 185 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2025-02-06 10:19:29,072 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 10 [2025-02-06 10:19:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:29,072 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2025-02-06 10:19:29,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-06 10:19:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2025-02-06 10:19:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:19:29,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:29,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:29,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:19:29,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:29,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -175740393, now seen corresponding path program 1 times [2025-02-06 10:19:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920871580] [2025-02-06 10:19:29,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:29,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:19:29,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:19:29,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:29,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:29,177 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-06 10:19:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:29,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920871580] [2025-02-06 10:19:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920871580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:29,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471222130] [2025-02-06 10:19:29,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:29,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:29,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:29,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:29,179 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:29,199 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2025-02-06 10:19:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:19:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:29,200 INFO L225 Difference]: With dead ends: 269 [2025-02-06 10:19:29,200 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 10:19:29,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:29,201 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:29,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 569 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 10:19:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2025-02-06 10:19:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 147 states have (on average 1.91156462585034) internal successors, (281), 228 states have internal predecessors, (281), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2025-02-06 10:19:29,206 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 12 [2025-02-06 10:19:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:29,207 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2025-02-06 10:19:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2025-02-06 10:19:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:19:29,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:29,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:19:29,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1382763695, now seen corresponding path program 1 times [2025-02-06 10:19:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993892703] [2025-02-06 10:19:29,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:29,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:19:29,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:19:29,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:29,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:29,266 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-06 10:19:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993892703] [2025-02-06 10:19:29,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993892703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:29,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635669582] [2025-02-06 10:19:29,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:29,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:29,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:29,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:29,268 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:29,359 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2025-02-06 10:19:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:19:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:29,360 INFO L225 Difference]: With dead ends: 218 [2025-02-06 10:19:29,360 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 10:19:29,360 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-06 10:19:29,361 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:29,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 209 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 10:19:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-06 10:19:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.7074829931972788) internal successors, (251), 213 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 255 transitions. [2025-02-06 10:19:29,365 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 255 transitions. Word has length 14 [2025-02-06 10:19:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:29,366 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 255 transitions. [2025-02-06 10:19:29,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 255 transitions. [2025-02-06 10:19:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:19:29,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:29,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:29,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:19:29,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1382763694, now seen corresponding path program 1 times [2025-02-06 10:19:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58673621] [2025-02-06 10:19:29,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:29,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:19:29,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:19:29,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:29,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:29,438 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-06 10:19:29,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:29,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58673621] [2025-02-06 10:19:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58673621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:29,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157574794] [2025-02-06 10:19:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:29,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:29,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:29,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:29,440 INFO L87 Difference]: Start difference. First operand 218 states and 255 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:29,525 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2025-02-06 10:19:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:29,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:19:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:29,526 INFO L225 Difference]: With dead ends: 203 [2025-02-06 10:19:29,527 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 10:19:29,527 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-06 10:19:29,527 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:29,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 211 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 10:19:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-06 10:19:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 198 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2025-02-06 10:19:29,536 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 14 [2025-02-06 10:19:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:29,536 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2025-02-06 10:19:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2025-02-06 10:19:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:19:29,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:29,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:29,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:19:29,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:29,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1356201994, now seen corresponding path program 1 times [2025-02-06 10:19:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:29,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993947243] [2025-02-06 10:19:29,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:29,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:19:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:19:29,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:29,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:29,646 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-06 10:19:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993947243] [2025-02-06 10:19:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993947243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:29,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:29,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104908685] [2025-02-06 10:19:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:29,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:29,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:29,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:29,648 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:29,802 INFO L93 Difference]: Finished difference Result 256 states and 291 transitions. [2025-02-06 10:19:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:29,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:19:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:29,803 INFO L225 Difference]: With dead ends: 256 [2025-02-06 10:19:29,803 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 10:19:29,804 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-06 10:19:29,805 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 24 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:29,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 421 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 10:19:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 211. [2025-02-06 10:19:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 206 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2025-02-06 10:19:29,810 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 19 [2025-02-06 10:19:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:29,810 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2025-02-06 10:19:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2025-02-06 10:19:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:19:29,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:29,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:19:29,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:29,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1356201993, now seen corresponding path program 1 times [2025-02-06 10:19:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21799009] [2025-02-06 10:19:29,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:29,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:29,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:19:29,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:19:29,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:29,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:30,025 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-06 10:19:30,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21799009] [2025-02-06 10:19:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21799009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:19:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303479765] [2025-02-06 10:19:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:30,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:19:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:30,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:19:30,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:30,028 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:30,173 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2025-02-06 10:19:30,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:19:30,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:19:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:30,174 INFO L225 Difference]: With dead ends: 211 [2025-02-06 10:19:30,174 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 10:19:30,174 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-06 10:19:30,175 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:30,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 437 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 10:19:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-06 10:19:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.4774193548387098) internal successors, (229), 206 states have internal predecessors, (229), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2025-02-06 10:19:30,178 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 19 [2025-02-06 10:19:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:30,179 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2025-02-06 10:19:30,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2025-02-06 10:19:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:19:30,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:30,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:30,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:19:30,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:30,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 738649959, now seen corresponding path program 1 times [2025-02-06 10:19:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747390639] [2025-02-06 10:19:30,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:30,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:30,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:30,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:30,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:30,341 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-06 10:19:30,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:30,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747390639] [2025-02-06 10:19:30,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747390639] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:30,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994367918] [2025-02-06 10:19:30,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:30,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:30,344 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-06 10:19:30,345 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-06 10:19:30,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:30,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:30,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:30,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:30,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:19:30,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:30,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:19:30,493 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-06 10:19:30,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:30,538 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-06 10:19:30,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 31 treesize of output 13 [2025-02-06 10:19:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:30,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:30,615 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 10:19:30,615 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 21 treesize of output 20 [2025-02-06 10:19:30,705 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-06 10:19:30,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994367918] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:30,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:30,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 10:19:30,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981962833] [2025-02-06 10:19:30,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:30,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:19:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:30,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:19:30,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=82, Unknown=3, NotChecked=0, Total=110 [2025-02-06 10:19:30,714 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:31,163 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2025-02-06 10:19:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:19:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:31,164 INFO L225 Difference]: With dead ends: 212 [2025-02-06 10:19:31,164 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 10:19:31,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=95, Unknown=3, NotChecked=0, Total=132 [2025-02-06 10:19:31,165 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 24 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:31,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 845 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:19:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 10:19:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2025-02-06 10:19:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 205 states have internal predecessors, (227), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2025-02-06 10:19:31,168 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 24 [2025-02-06 10:19:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:31,169 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2025-02-06 10:19:31,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2025-02-06 10:19:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:19:31,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:31,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:31,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:19:31,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 10:19:31,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:31,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash 738649960, now seen corresponding path program 1 times [2025-02-06 10:19:31,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:31,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911668897] [2025-02-06 10:19:31,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:31,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:31,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:31,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:31,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:31,716 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-06 10:19:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:31,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911668897] [2025-02-06 10:19:31,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911668897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:31,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473676949] [2025-02-06 10:19:31,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:31,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:31,720 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-06 10:19:31,724 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-06 10:19:31,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:31,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:31,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:31,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:31,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:19:31,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:31,812 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-06 10:19:31,818 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 13 treesize of output 1 [2025-02-06 10:19:31,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:19:31,831 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-06 10:19:31,837 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-06 10:19:31,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:31,908 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-06 10:19:31,912 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-06 10:19:31,959 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-06 10:19:31,965 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-06 10:19:31,983 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-06 10:19:31,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:32,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_220) c_create_data_~data~0.base) .cse0)))))) is different from false [2025-02-06 10:19:32,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1))))))) is different from false [2025-02-06 10:19:32,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,120 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-06 10:19:32,124 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-06 10:19:32,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,135 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 45 treesize of output 46 [2025-02-06 10:19:32,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,140 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 35 treesize of output 36 [2025-02-06 10:19:32,142 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:32,143 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 33 treesize of output 21 [2025-02-06 10:19:32,145 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:32,146 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-06 10:19:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-06 10:19:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473676949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:32,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-02-06 10:19:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867895169] [2025-02-06 10:19:32,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:32,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:19:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:32,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:19:32,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=212, Unknown=4, NotChecked=62, Total=342 [2025-02-06 10:19:32,167 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:32,540 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2025-02-06 10:19:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:19:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:19:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:32,541 INFO L225 Difference]: With dead ends: 220 [2025-02-06 10:19:32,541 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 10:19:32,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=260, Unknown=4, NotChecked=70, Total=420 [2025-02-06 10:19:32,542 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 8 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:32,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 975 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 543 Invalid, 0 Unknown, 164 Unchecked, 0.3s Time] [2025-02-06 10:19:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 10:19:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-06 10:19:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 165 states have (on average 1.4363636363636363) internal successors, (237), 215 states have internal predecessors, (237), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2025-02-06 10:19:32,545 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 24 [2025-02-06 10:19:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:32,545 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2025-02-06 10:19:32,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2025-02-06 10:19:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:19:32,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:32,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:32,555 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-06 10:19:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:32,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1224081047, now seen corresponding path program 2 times [2025-02-06 10:19:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552883737] [2025-02-06 10:19:32,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:19:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:32,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 10:19:32,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:19:32,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:19:32,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:33,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:33,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552883737] [2025-02-06 10:19:33,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552883737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:33,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221523237] [2025-02-06 10:19:33,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:19:33,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:33,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:33,174 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-06 10:19:33,182 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-06 10:19:33,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 10:19:33,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:19:33,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:19:33,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:33,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 10:19:33,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:33,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:19:33,270 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 13 treesize of output 1 [2025-02-06 10:19:33,287 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-06 10:19:33,291 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-06 10:19:33,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:33,378 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-06 10:19:33,382 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-06 10:19:33,465 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:33,466 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-06 10:19:33,471 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-06 10:19:33,510 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-06 10:19:33,514 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-06 10:19:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:33,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:33,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_295) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_295) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_296) c_create_data_~data~0.base) .cse1)))))) is different from false [2025-02-06 10:19:33,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2025-02-06 10:19:33,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 8)))))) is different from false [2025-02-06 10:19:33,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_293))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_293) c_create_data_~data~0.base) .cse2) v_ArrVal_295) c_create_data_~data~0.base) .cse2) 8))))) is different from false [2025-02-06 10:19:33,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) v_ArrVal_295) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_293))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) .cse3 v_ArrVal_295) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_296) c_create_data_~data~0.base) .cse1))))))))) is different from false [2025-02-06 10:19:33,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:33,725 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 89 treesize of output 90 [2025-02-06 10:19:33,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:33,730 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 79 treesize of output 60 [2025-02-06 10:19:33,733 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 754 treesize of output 640 [2025-02-06 10:19:33,745 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 745 treesize of output 697 [2025-02-06 10:19:33,751 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 132 treesize of output 100 [2025-02-06 10:19:33,754 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 77 treesize of output 73 [2025-02-06 10:19:33,756 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 96 treesize of output 84 [2025-02-06 10:19:33,760 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 18 treesize of output 14 [2025-02-06 10:19:33,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:33,783 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 46 treesize of output 47 [2025-02-06 10:19:33,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:33,788 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 36 treesize of output 37 [2025-02-06 10:19:33,790 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:33,791 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 34 treesize of output 22 [2025-02-06 10:19:33,793 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:33,794 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-06 10:19:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2025-02-06 10:19:33,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221523237] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:33,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:33,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2025-02-06 10:19:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967472085] [2025-02-06 10:19:33,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:19:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:19:33,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=451, Unknown=8, NotChecked=240, Total=812 [2025-02-06 10:19:33,831 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:34,387 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2025-02-06 10:19:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:19:34,387 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:19:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:34,388 INFO L225 Difference]: With dead ends: 230 [2025-02-06 10:19:34,388 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 10:19:34,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=608, Unknown=8, NotChecked=280, Total=1056 [2025-02-06 10:19:34,389 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 16 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:34,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1437 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 745 Invalid, 0 Unknown, 436 Unchecked, 0.4s Time] [2025-02-06 10:19:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 10:19:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-02-06 10:19:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 225 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 251 transitions. [2025-02-06 10:19:34,393 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 251 transitions. Word has length 29 [2025-02-06 10:19:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:34,393 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 251 transitions. [2025-02-06 10:19:34,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2025-02-06 10:19:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:19:34,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:34,394 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:34,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:19:34,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:34,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:34,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2031160520, now seen corresponding path program 3 times [2025-02-06 10:19:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222701102] [2025-02-06 10:19:34,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:19:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:34,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-02-06 10:19:34,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:19:34,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:19:34,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:35,079 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-06 10:19:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222701102] [2025-02-06 10:19:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222701102] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452053069] [2025-02-06 10:19:35,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:19:35,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:35,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:35,084 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-06 10:19:35,084 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-06 10:19:35,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-02-06 10:19:35,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:19:35,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:19:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:35,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 10:19:35,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:35,190 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-06 10:19:35,200 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-06 10:19:35,202 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 13 treesize of output 1 [2025-02-06 10:19:35,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:19:35,210 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-06 10:19:35,213 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-06 10:19:35,282 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:35,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 62 treesize of output 57 [2025-02-06 10:19:35,285 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-06 10:19:35,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:35,361 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-06 10:19:35,364 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-06 10:19:35,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:35,445 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-06 10:19:35,450 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-06 10:19:35,492 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-06 10:19:35,497 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-06 10:19:35,517 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-06 10:19:35,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:35,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_386) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_386) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_385) c_create_data_~data~0.base) .cse1)))))) is different from false [2025-02-06 10:19:35,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse2) 4))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_385) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-02-06 10:19:35,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_385) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-02-06 10:19:35,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_384))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_383) .cse0 v_ArrVal_386) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_385) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_384) c_create_data_~data~0.base) .cse1) v_ArrVal_386) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2025-02-06 10:19:35,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_384))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_383) .cse2 v_ArrVal_386) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_385) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_384) c_create_data_~data~0.base) .cse3) v_ArrVal_386) c_create_data_~data~0.base) .cse3) 12)))))) is different from false [2025-02-06 10:19:35,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_382))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_384))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_381) .cse1 v_ArrVal_383) .cse2 v_ArrVal_386) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_385) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_382))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_381) .cse6 v_ArrVal_383) (select (select (store .cse7 .cse6 v_ArrVal_384) c_create_data_~data~0.base) .cse3) v_ArrVal_386))) c_create_data_~data~0.base) .cse3) 12))))) is different from false [2025-02-06 10:19:36,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_382))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_381) .cse1 v_ArrVal_383) (select (select (store .cse2 .cse1 v_ArrVal_384) c_create_data_~data~0.base) .cse3) v_ArrVal_386))) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_382))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_384))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (<= (+ 16 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_381) .cse4 v_ArrVal_383) .cse5 v_ArrVal_386) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_385) c_create_data_~data~0.base) .cse3))))))))))) is different from false [2025-02-06 10:19:36,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:36,138 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-06 10:19:36,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:36,143 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-06 10:19:36,148 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 392 treesize of output 332 [2025-02-06 10:19:36,161 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 554 treesize of output 524 [2025-02-06 10:19:36,173 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 44 treesize of output 36 [2025-02-06 10:19:36,178 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 36 treesize of output 32 [2025-02-06 10:19:36,182 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 32 treesize of output 28 [2025-02-06 10:19:36,187 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-06 10:19:36,192 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 14 treesize of output 10 [2025-02-06 10:19:36,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:36,207 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-06 10:19:36,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:36,217 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-06 10:19:36,219 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:36,225 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 916 treesize of output 610 [2025-02-06 10:19:36,233 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:36,234 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-06 10:19:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 21 not checked. [2025-02-06 10:19:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452053069] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:36,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:36,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 33 [2025-02-06 10:19:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282496177] [2025-02-06 10:19:36,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:36,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:19:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:36,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:19:36,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=568, Unknown=15, NotChecked=392, Total=1122 [2025-02-06 10:19:36,289 INFO L87 Difference]: Start difference. First operand 230 states and 251 transitions. Second operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:37,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse3)) (.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_384))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_383) .cse2 v_ArrVal_386) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_385) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse3) 8))) (<= 0 (+ .cse5 .cse0 4)) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_384) c_create_data_~data~0.base) .cse3) v_ArrVal_386) c_create_data_~data~0.base) .cse3) 12))) (<= (+ .cse5 .cse0 8) (select |c_#length| .cse1)) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse3) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_385) c_create_data_~data~0.base) .cse3))))))) is different from false [2025-02-06 10:19:37,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse4)) (.cse1 (* c_create_data_~counter~0 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_384))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (<= (+ .cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_383) .cse3 v_ArrVal_386) c_create_data_~data~0.base) .cse4) 12) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_385) c_create_data_~data~0.base) .cse4)))))) (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_386) c_create_data_~data~0.base) .cse4) 4))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_386) c_create_data_~data~0.base) .cse4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_385) c_create_data_~data~0.base) .cse4)))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse1 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_384) c_create_data_~data~0.base) .cse4) v_ArrVal_386) c_create_data_~data~0.base) .cse4))))))) is different from false [2025-02-06 10:19:37,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_384))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_383) .cse0 v_ArrVal_386) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_385) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse2 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_386) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_384) c_create_data_~data~0.base) .cse1) v_ArrVal_386) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse2 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_386) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_385) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse2)) (<= (+ |c_create_data_#t~mem8.offset| .cse2 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2025-02-06 10:19:37,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse2) 8))) (<= 0 (+ .cse3 .cse0 4)) (<= (+ .cse3 .cse0 8) (select |c_#length| .cse1)) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_386) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_385) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-02-06 10:19:37,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse3)) (.cse1 (* c_create_data_~counter~0 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_386) c_create_data_~data~0.base) .cse3) 4))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_386) c_create_data_~data~0.base) .cse3) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_385) c_create_data_~data~0.base) .cse3))))))) is different from false [2025-02-06 10:19:37,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_386 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_386) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_386) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_385) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse0)) (<= (+ |c_create_data_#t~mem8.offset| .cse0 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2025-02-06 10:19:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:37,931 INFO L93 Difference]: Finished difference Result 320 states and 357 transitions. [2025-02-06 10:19:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:19:37,931 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 10:19:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:37,933 INFO L225 Difference]: With dead ends: 320 [2025-02-06 10:19:37,933 INFO L226 Difference]: Without dead ends: 320 [2025-02-06 10:19:37,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=259, Invalid=893, Unknown=22, NotChecked=988, Total=2162 [2025-02-06 10:19:37,934 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 38 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 1233 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:37,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2011 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1121 Invalid, 7 Unknown, 1233 Unchecked, 0.9s Time] [2025-02-06 10:19:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-06 10:19:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 280. [2025-02-06 10:19:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 225 states have (on average 1.3555555555555556) internal successors, (305), 275 states have internal predecessors, (305), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 309 transitions. [2025-02-06 10:19:37,945 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 309 transitions. Word has length 34 [2025-02-06 10:19:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:37,945 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 309 transitions. [2025-02-06 10:19:37,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 309 transitions. [2025-02-06 10:19:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:19:37,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:37,946 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:37,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:19:38,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 10:19:38,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:38,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash -902626304, now seen corresponding path program 1 times [2025-02-06 10:19:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:38,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732448752] [2025-02-06 10:19:38,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:38,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:38,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:19:38,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:19:38,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:38,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 10:19:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732448752] [2025-02-06 10:19:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732448752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:38,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:38,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634994971] [2025-02-06 10:19:38,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:38,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:38,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:38,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:38,201 INFO L87 Difference]: Start difference. First operand 280 states and 309 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:38,274 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2025-02-06 10:19:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:38,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:19:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:38,278 INFO L225 Difference]: With dead ends: 278 [2025-02-06 10:19:38,278 INFO L226 Difference]: Without dead ends: 278 [2025-02-06 10:19:38,279 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-06 10:19:38,279 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 6 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:38,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-06 10:19:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-02-06 10:19:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 225 states have (on average 1.3377777777777777) internal successors, (301), 273 states have internal predecessors, (301), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 305 transitions. [2025-02-06 10:19:38,285 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 305 transitions. Word has length 46 [2025-02-06 10:19:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:38,286 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 305 transitions. [2025-02-06 10:19:38,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 305 transitions. [2025-02-06 10:19:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:19:38,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:38,289 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:38,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:19:38,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:38,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:38,289 INFO L85 PathProgramCache]: Analyzing trace with hash -902626303, now seen corresponding path program 1 times [2025-02-06 10:19:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:38,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557721255] [2025-02-06 10:19:38,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:38,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:38,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:19:38,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:19:38,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:38,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557721255] [2025-02-06 10:19:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557721255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440513916] [2025-02-06 10:19:38,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:38,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:38,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:38,374 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:38,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:19:38,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:19:38,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:19:38,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:38,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:38,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:19:38,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:38,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440513916] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:38,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 10:19:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30145242] [2025-02-06 10:19:38,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:19:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:38,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:19:38,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:19:38,574 INFO L87 Difference]: Start difference. First operand 278 states and 305 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:38,611 INFO L93 Difference]: Finished difference Result 292 states and 313 transitions. [2025-02-06 10:19:38,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:19:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:19:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:38,615 INFO L225 Difference]: With dead ends: 292 [2025-02-06 10:19:38,616 INFO L226 Difference]: Without dead ends: 292 [2025-02-06 10:19:38,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:19:38,616 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 8 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:38,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 792 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-06 10:19:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-06 10:19:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 239 states have (on average 1.292887029288703) internal successors, (309), 287 states have internal predecessors, (309), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:19:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 313 transitions. [2025-02-06 10:19:38,621 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 313 transitions. Word has length 46 [2025-02-06 10:19:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:38,622 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 313 transitions. [2025-02-06 10:19:38,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 313 transitions. [2025-02-06 10:19:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:19:38,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:38,623 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:38,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:19:38,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 10:19:38,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-06 10:19:38,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1870613111, now seen corresponding path program 4 times [2025-02-06 10:19:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763807670] [2025-02-06 10:19:38,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:19:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:38,841 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-06 10:19:38,875 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:19:38,875 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:19:38,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:40,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:40,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763807670] [2025-02-06 10:19:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763807670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555123170] [2025-02-06 10:19:40,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:19:40,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:40,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:40,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:40,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:19:40,320 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-06 10:19:40,564 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:19:40,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:19:40,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:40,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-06 10:19:40,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:40,593 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-06 10:19:40,597 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 13 treesize of output 1 [2025-02-06 10:19:40,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:19:40,652 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 15 treesize of output 1 [2025-02-06 10:19:40,655 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-06 10:19:40,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:19:40,836 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 62 [2025-02-06 10:19:40,840 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 50 treesize of output 14 [2025-02-06 10:19:41,013 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:41,014 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 50 treesize of output 45 [2025-02-06 10:19:41,030 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-06 10:19:41,172 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:41,172 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 50 treesize of output 45 [2025-02-06 10:19:41,177 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-06 10:19:41,318 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:41,319 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 50 treesize of output 45 [2025-02-06 10:19:41,326 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-06 10:19:41,467 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:41,468 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 50 treesize of output 45 [2025-02-06 10:19:41,475 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-06 10:19:41,620 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:41,621 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 50 treesize of output 45 [2025-02-06 10:19:41,629 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 20 [2025-02-06 10:19:41,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:41,886 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 50 treesize of output 45 [2025-02-06 10:19:41,895 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 20 [2025-02-06 10:19:42,045 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:42,045 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 77 treesize of output 70 [2025-02-06 10:19:42,052 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2025-02-06 10:19:42,129 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 25 treesize of output 13 [2025-02-06 10:19:42,132 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 26 treesize of output 14 [2025-02-06 10:19:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:42,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:42,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_701 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_701))) (let ((.cse2 (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 4))) (or (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_702 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_700))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_702)) c_create_data_~data~0.base) .cse3) .cse4 12) (select |c_#length| (select (select (store .cse5 .cse1 v_ArrVal_704) c_create_data_~data~0.base) .cse3)))))) (< .cse2 0))))) (forall ((v_ArrVal_701 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_701))) (let ((.cse6 (+ (select (select .cse7 c_create_data_~data~0.base) .cse3) .cse4 4))) (or (< .cse6 0) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_702 Int)) (<= 0 (+ (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_700) c_create_data_~data~0.base) .cse3))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse6 v_ArrVal_702))) c_create_data_~data~0.base) .cse3) .cse4 8))))))))) is different from false [2025-02-06 10:19:42,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_701 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_701))) (let ((.cse0 (+ (select (select .cse1 c_create_data_~data~0.base) .cse3) .cse4 4))) (or (< .cse0 0) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_702 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_700))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_702)) c_create_data_~data~0.base) .cse3) .cse4 12) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_704) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_701 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_701))) (let ((.cse7 (+ (select (select .cse8 c_create_data_~data~0.base) .cse3) .cse4 4))) (or (< .cse7 0) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_702 Int)) (<= 0 (+ (select (select (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_700) c_create_data_~data~0.base) .cse3))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse7 v_ArrVal_702))) c_create_data_~data~0.base) .cse3) .cse4 8)))))))))) is different from false [2025-02-06 10:19:42,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (* c_create_data_~counter~0 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_701 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_701))) (let ((.cse2 (+ (select (select .cse0 c_create_data_~data~0.base) .cse4) .cse5 8))) (or (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_702 Int)) (<= 0 (+ (select (select (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_700) c_create_data_~data~0.base) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_702))) c_create_data_~data~0.base) .cse4) .cse5 12))) (< .cse2 0))))) (forall ((v_ArrVal_701 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_701))) (let ((.cse8 (+ (select (select .cse6 c_create_data_~data~0.base) .cse4) .cse5 8))) (or (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_702 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_700))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_702)) c_create_data_~data~0.base) .cse4) 16 .cse5) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_704) c_create_data_~data~0.base) .cse4)))))) (< .cse8 0)))))))) is different from false [2025-02-06 10:19:43,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_create_data_~counter~0 1)) (.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_696)) (.cse1 (* v_create_data_~counter~0_47 4))) (or (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_697))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse10 .cse9 v_ArrVal_698))) (let ((.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store (store .cse8 .cse9 v_ArrVal_699) .cse7 v_ArrVal_701))) (let ((.cse0 (+ (select (select .cse2 c_create_data_~data~0.base) .cse4) .cse1 8))) (or (< .cse0 0) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_702 Int)) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_700))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (<= (+ 16 .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse0 v_ArrVal_702)) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_704) c_create_data_~data~0.base) .cse4)))))))))))))) (< .cse11 v_create_data_~counter~0_47) (< (+ (select (select .cse8 c_create_data_~data~0.base) .cse4) .cse1) 0)))) (forall ((v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse13 (* v_create_data_~counter~0_47 4)) (.cse12 (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_696))) (or (< .cse11 v_create_data_~counter~0_47) (< (+ (select (select .cse12 c_create_data_~data~0.base) .cse4) .cse13) 0) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_697))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse4))) (let ((.cse17 (store .cse20 .cse19 v_ArrVal_698))) (let ((.cse18 (select (select .cse17 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store (store .cse12 .cse19 v_ArrVal_699) .cse18 v_ArrVal_701))) (let ((.cse14 (+ (select (select .cse15 c_create_data_~data~0.base) .cse4) .cse13 8))) (or (< .cse14 0) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_702 Int)) (<= 0 (+ .cse13 12 (select (select (let ((.cse16 (select (select (store .cse17 .cse18 v_ArrVal_700) c_create_data_~data~0.base) .cse4))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse14 v_ArrVal_702))) c_create_data_~data~0.base) .cse4))))))))))))))))) is different from false [2025-02-06 10:19:43,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse11 (+ c_create_data_~counter~0 1)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse0 (* v_create_data_~counter~0_47 4)) (.cse1 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_696))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_697))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_698))) (let ((.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store (store .cse1 .cse8 v_ArrVal_699) .cse7 v_ArrVal_701))) (let ((.cse3 (+ (select (select .cse4 c_create_data_~data~0.base) .cse2) .cse0 8))) (or (< .cse3 0) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_702 Int)) (<= 0 (+ (select (select (let ((.cse5 (select (select (store .cse6 .cse7 v_ArrVal_700) c_create_data_~data~0.base) .cse2))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse3 v_ArrVal_702))) c_create_data_~data~0.base) .cse2) .cse0 12))))))))))) (< .cse11 v_create_data_~counter~0_47)))) (forall ((v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse12 (* v_create_data_~counter~0_47 4)) (.cse13 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_696))) (or (< (+ .cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2)) 0) (< .cse11 v_create_data_~counter~0_47) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_697))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse2))) (let ((.cse18 (store .cse21 .cse20 v_ArrVal_698))) (let ((.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse2))) (let ((.cse14 (store (store .cse13 .cse20 v_ArrVal_699) .cse19 v_ArrVal_701))) (let ((.cse16 (+ (select (select .cse14 c_create_data_~data~0.base) .cse2) .cse12 8))) (or (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_702 Int)) (let ((.cse17 (store .cse18 .cse19 v_ArrVal_700))) (let ((.cse15 (select (select .cse17 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 v_ArrVal_702)) c_create_data_~data~0.base) .cse2) 16 .cse12) (select |c_#length| (select (select (store .cse17 .cse15 v_ArrVal_704) c_create_data_~data~0.base) .cse2)))))) (< .cse16 0))))))))))))))) is different from false [2025-02-06 10:19:43,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (+ c_create_data_~counter~0 2)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_697))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse2))) (let ((.cse7 (store .cse12 .cse10 v_ArrVal_698))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_696)) (.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store (store .cse1 .cse10 v_ArrVal_699) .cse8 v_ArrVal_701)) (.cse0 (* v_create_data_~counter~0_47 4))) (let ((.cse5 (+ (select (select .cse3 c_create_data_~data~0.base) .cse2) .cse0 8))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_700))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_702)) c_create_data_~data~0.base) .cse2) 15 .cse0) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_704) c_create_data_~data~0.base) .cse2))))) (< .cse5 0) (< .cse9 v_create_data_~counter~0_47))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_697))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse2))) (let ((.cse18 (store .cse21 .cse20 v_ArrVal_698))) (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_696)) (.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse2))) (let ((.cse15 (store (store .cse14 .cse20 v_ArrVal_699) .cse19 v_ArrVal_701)) (.cse13 (* v_create_data_~counter~0_47 4))) (let ((.cse17 (+ (select (select .cse15 c_create_data_~data~0.base) .cse2) .cse13 8))) (or (< (+ .cse13 (select (select .cse14 c_create_data_~data~0.base) .cse2)) 0) (< 0 (+ (select (select (let ((.cse16 (select (select (store .cse18 .cse19 v_ArrVal_700) c_create_data_~data~0.base) .cse2))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 v_ArrVal_702))) c_create_data_~data~0.base) .cse2) .cse13 13)) (< .cse17 0) (< .cse9 v_create_data_~counter~0_47)))))))))))) is different from false [2025-02-06 10:19:43,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_create_data_~counter~0 2)) (.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_695))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse11 v_ArrVal_697))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse12 .cse10 v_ArrVal_698))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_694) .cse11 v_ArrVal_696)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store (store .cse8 .cse10 v_ArrVal_699) .cse7 v_ArrVal_701)) (.cse1 (* v_create_data_~counter~0_47 4))) (let ((.cse0 (+ (select (select .cse2 c_create_data_~data~0.base) .cse4) .cse1 8))) (or (< .cse0 0) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_700))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (< (+ 15 .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse0 v_ArrVal_702)) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_704) c_create_data_~data~0.base) .cse4))))) (< (+ (select (select .cse8 c_create_data_~data~0.base) .cse4) .cse1) 0) (< .cse9 v_create_data_~counter~0_47))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_695))) (let ((.cse22 (select (select .cse24 c_create_data_~data~0.base) .cse4))) (let ((.cse23 (store .cse24 .cse22 v_ArrVal_697))) (let ((.cse21 (select (select .cse23 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store .cse23 .cse21 v_ArrVal_698))) (let ((.cse20 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_694) .cse22 v_ArrVal_696)) (.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store (store .cse20 .cse21 v_ArrVal_699) .cse19 v_ArrVal_701)) (.cse15 (* v_create_data_~counter~0_47 4))) (let ((.cse14 (+ (select (select .cse16 c_create_data_~data~0.base) .cse4) .cse15 8))) (or (< .cse14 0) (< 0 (+ .cse15 13 (select (select (let ((.cse17 (select (select (store .cse18 .cse19 v_ArrVal_700) c_create_data_~data~0.base) .cse4))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse14 v_ArrVal_702))) c_create_data_~data~0.base) .cse4))) (< (+ (select (select .cse20 c_create_data_~data~0.base) .cse4) .cse15) 0) (< .cse9 v_create_data_~counter~0_47))))))))))))) is different from false [2025-02-06 10:19:43,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (+ c_create_data_~counter~0 2)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_695))) (let ((.cse12 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse12 v_ArrVal_697))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse13 .cse10 v_ArrVal_698))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_694) .cse12 v_ArrVal_696)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse0 (* v_create_data_~counter~0_47 4)) (.cse1 (store (store .cse8 .cse10 v_ArrVal_699) .cse7 v_ArrVal_701))) (let ((.cse3 (+ .cse0 8 (select (select .cse1 c_create_data_~data~0.base) .cse4)))) (or (let ((.cse5 (store .cse6 .cse7 v_ArrVal_700))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (< (+ 15 .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_702)) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_704) c_create_data_~data~0.base) .cse4))))) (< (+ .cse0 (select (select .cse8 c_create_data_~data~0.base) .cse4)) 0) (< .cse9 v_create_data_~counter~0_47) (< .cse3 0))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_695))) (let ((.cse23 (select (select .cse25 c_create_data_~data~0.base) .cse4))) (let ((.cse24 (store .cse25 .cse23 v_ArrVal_697))) (let ((.cse22 (select (select .cse24 c_create_data_~data~0.base) .cse4))) (let ((.cse19 (store .cse24 .cse22 v_ArrVal_698))) (let ((.cse21 (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_694) .cse23 v_ArrVal_696)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (* v_create_data_~counter~0_47 4)) (.cse16 (store (store .cse21 .cse22 v_ArrVal_699) .cse20 v_ArrVal_701))) (let ((.cse18 (+ .cse15 8 (select (select .cse16 c_create_data_~data~0.base) .cse4)))) (or (< 0 (+ .cse15 (select (select (let ((.cse17 (select (select (store .cse19 .cse20 v_ArrVal_700) c_create_data_~data~0.base) .cse4))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_702))) c_create_data_~data~0.base) .cse4) 13)) (< (+ .cse15 (select (select .cse21 c_create_data_~data~0.base) .cse4)) 0) (< .cse9 v_create_data_~counter~0_47) (< .cse18 0)))))))))))))) is different from false [2025-02-06 10:19:44,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (+ c_create_data_~counter~0 3)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_695))) (let ((.cse12 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse12 v_ArrVal_697))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse13 .cse10 v_ArrVal_698))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_694) .cse12 v_ArrVal_696)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse0 (* v_create_data_~counter~0_47 4)) (.cse1 (store (store .cse9 .cse10 v_ArrVal_699) .cse7 v_ArrVal_701))) (let ((.cse3 (+ .cse0 8 (select (select .cse1 c_create_data_~data~0.base) .cse4)))) (or (let ((.cse5 (store .cse6 .cse7 v_ArrVal_700))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (< (+ 15 .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_702)) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_704) c_create_data_~data~0.base) .cse4))))) (< .cse8 v_create_data_~counter~0_47) (< (+ .cse0 (select (select .cse9 c_create_data_~data~0.base) .cse4)) 0) (< .cse3 0))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_695))) (let ((.cse23 (select (select .cse25 c_create_data_~data~0.base) .cse4))) (let ((.cse24 (store .cse25 .cse23 v_ArrVal_697))) (let ((.cse22 (select (select .cse24 c_create_data_~data~0.base) .cse4))) (let ((.cse19 (store .cse24 .cse22 v_ArrVal_698))) (let ((.cse21 (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_694) .cse23 v_ArrVal_696)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (* v_create_data_~counter~0_47 4)) (.cse16 (store (store .cse21 .cse22 v_ArrVal_699) .cse20 v_ArrVal_701))) (let ((.cse18 (+ .cse15 8 (select (select .cse16 c_create_data_~data~0.base) .cse4)))) (or (< .cse8 v_create_data_~counter~0_47) (< 0 (+ .cse15 (select (select (let ((.cse17 (select (select (store .cse19 .cse20 v_ArrVal_700) c_create_data_~data~0.base) .cse4))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_702))) c_create_data_~data~0.base) .cse4) 13)) (< (+ .cse15 (select (select .cse21 c_create_data_~data~0.base) .cse4)) 0) (< .cse18 0)))))))))))))) is different from false [2025-02-06 10:20:05,500 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (+ c_create_data_~counter~0 4)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_create_data_~counter~0_47 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_692))) (let ((.cse12 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse16 .cse12 v_ArrVal_695))) (let ((.cse13 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_697))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse14 .cse10 v_ArrVal_698))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_693) .cse12 v_ArrVal_694) .cse13 v_ArrVal_696)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store .cse8 .cse10 v_ArrVal_699) .cse7 v_ArrVal_701)) (.cse0 (* v_create_data_~counter~0_47 4))) (let ((.cse3 (+ (select (select .cse1 c_create_data_~data~0.base) .cse4) .cse0 8))) (or (let ((.cse5 (store .cse6 .cse7 v_ArrVal_700))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (< (+ 15 .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_702)) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_704) c_create_data_~data~0.base) .cse4))))) (< (+ (select (select .cse8 c_create_data_~data~0.base) .cse4) .cse0) 0) (< .cse9 v_create_data_~counter~0_47) (< .cse3 0))))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_create_data_~counter~0_47 Int) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_692))) (let ((.cse25 (select (select .cse29 c_create_data_~data~0.base) .cse4))) (let ((.cse28 (store .cse29 .cse25 v_ArrVal_695))) (let ((.cse26 (select (select .cse28 c_create_data_~data~0.base) .cse4))) (let ((.cse27 (store .cse28 .cse26 v_ArrVal_697))) (let ((.cse24 (select (select .cse27 c_create_data_~data~0.base) .cse4))) (let ((.cse21 (store .cse27 .cse24 v_ArrVal_698))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_693) .cse25 v_ArrVal_694) .cse26 v_ArrVal_696)) (.cse22 (select (select .cse21 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store (store .cse23 .cse24 v_ArrVal_699) .cse22 v_ArrVal_701)) (.cse17 (* v_create_data_~counter~0_47 4))) (let ((.cse20 (+ (select (select .cse18 c_create_data_~data~0.base) .cse4) .cse17 8))) (or (< 0 (+ .cse17 13 (select (select (let ((.cse19 (select (select (store .cse21 .cse22 v_ArrVal_700) c_create_data_~data~0.base) .cse4))) (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 v_ArrVal_702))) c_create_data_~data~0.base) .cse4))) (< (+ (select (select .cse23 c_create_data_~data~0.base) .cse4) .cse17) 0) (< .cse9 v_create_data_~counter~0_47) (< .cse20 0)))))))))))))))) is different from false [2025-02-06 10:20:05,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_create_data_~counter~0_47 Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_690))) (let ((.cse11 (select (select .cse17 c_create_data_~data~0.base) .cse3))) (let ((.cse16 (store .cse17 .cse11 v_ArrVal_692))) (let ((.cse12 (select (select .cse16 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (store .cse16 .cse12 v_ArrVal_695))) (let ((.cse13 (select (select .cse15 c_create_data_~data~0.base) .cse3))) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_697))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse14 .cse10 v_ArrVal_698))) (let ((.cse8 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_691) .cse11 v_ArrVal_693) .cse12 v_ArrVal_694) .cse13 v_ArrVal_696)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse0 (store (store .cse8 .cse10 v_ArrVal_699) .cse7 v_ArrVal_701)) (.cse4 (* v_create_data_~counter~0_47 4))) (let ((.cse2 (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 8))) (or (let ((.cse5 (store .cse6 .cse7 v_ArrVal_700))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_702)) c_create_data_~data~0.base) .cse3) 15 .cse4) (select |c_#length| (select (select (store .cse5 .cse1 v_ArrVal_704) c_create_data_~data~0.base) .cse3))))) (< (+ (select (select .cse8 c_create_data_~data~0.base) .cse3) .cse4) 0) (< .cse9 v_create_data_~counter~0_47) (< .cse2 0))))))))))))))) (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_create_data_~counter~0_47 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_690))) (let ((.cse26 (select (select .cse32 c_create_data_~data~0.base) .cse3))) (let ((.cse31 (store .cse32 .cse26 v_ArrVal_692))) (let ((.cse27 (select (select .cse31 c_create_data_~data~0.base) .cse3))) (let ((.cse30 (store .cse31 .cse27 v_ArrVal_695))) (let ((.cse28 (select (select .cse30 c_create_data_~data~0.base) .cse3))) (let ((.cse29 (store .cse30 .cse28 v_ArrVal_697))) (let ((.cse25 (select (select .cse29 c_create_data_~data~0.base) .cse3))) (let ((.cse21 (store .cse29 .cse25 v_ArrVal_698))) (let ((.cse24 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_691) .cse26 v_ArrVal_693) .cse27 v_ArrVal_694) .cse28 v_ArrVal_696)) (.cse22 (select (select .cse21 c_create_data_~data~0.base) .cse3))) (let ((.cse18 (store (store .cse24 .cse25 v_ArrVal_699) .cse22 v_ArrVal_701)) (.cse23 (* v_create_data_~counter~0_47 4))) (let ((.cse20 (+ (select (select .cse18 c_create_data_~data~0.base) .cse3) .cse23 8))) (or (< 0 (+ (select (select (let ((.cse19 (select (select (store .cse21 .cse22 v_ArrVal_700) c_create_data_~data~0.base) .cse3))) (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 v_ArrVal_702))) c_create_data_~data~0.base) .cse3) .cse23 13)) (< (+ (select (select .cse24 c_create_data_~data~0.base) .cse3) .cse23) 0) (< .cse9 v_create_data_~counter~0_47) (< .cse20 0))))))))))))))))) is different from false