./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df'] 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-?-4f9af40 [2024-11-07 16:29:35,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:29:35,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:29:35,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:29:35,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:29:35,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:29:35,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:29:35,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:29:35,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:29:35,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:29:35,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:29:35,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:29:35,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:29:35,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:29:35,990 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:29:35,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:29:35,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:29:35,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:29:35,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:29:35,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:29:35,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:35,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:29:35,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:29:35,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:29:35,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:29:35,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:29:35,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:29:35,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:29:35,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:29:35,992 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 [2024-11-07 16:29:36,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:29:36,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:29:36,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:29:36,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:29:36,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:29:36,262 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 [2024-11-07 16:29:37,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:29:37,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:29:37,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-07 16:29:37,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/335606e56/f190ce7ad88547d4bbf87719dc58ec6e/FLAGb7ca4274b [2024-11-07 16:29:37,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/335606e56/f190ce7ad88547d4bbf87719dc58ec6e [2024-11-07 16:29:37,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:29:37,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:29:37,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:37,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:29:37,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:29:37,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:37" (1/1) ... [2024-11-07 16:29:37,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f0ae04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:37, skipping insertion in model container [2024-11-07 16:29:37,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:37" (1/1) ... [2024-11-07 16:29:37,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:29:38,154 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:29:38,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:38,179 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:29:38,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:38,272 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:29:38,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38 WrapperNode [2024-11-07 16:29:38,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:38,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:38,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:29:38,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:29:38,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,305 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-11-07 16:29:38,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:38,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:29:38,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:29:38,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:29:38,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,349 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]. [2024-11-07 16:29:38,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:29:38,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:29:38,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:29:38,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:29:38,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (1/1) ... [2024-11-07 16:29:38,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:38,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:38,420 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) [2024-11-07 16:29:38,423 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 [2024-11-07 16:29:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:29:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:29:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 16:29:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:29:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:29:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 16:29:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:29:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-07 16:29:38,448 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-07 16:29:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:29:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:29:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:29:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:29:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:29:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:29:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:29:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:29:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:29:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:29:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:29:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 16:29:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:29:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:29:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 16:29:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:29:38,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:29:38,557 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:29:38,558 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:29:39,059 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-07 16:29:39,060 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:29:39,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:29:39,078 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 16:29:39,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:39 BoogieIcfgContainer [2024-11-07 16:29:39,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:29:39,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:29:39,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:29:39,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:29:39,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:29:37" (1/3) ... [2024-11-07 16:29:39,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21643dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:39, skipping insertion in model container [2024-11-07 16:29:39,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:38" (2/3) ... [2024-11-07 16:29:39,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21643dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:39, skipping insertion in model container [2024-11-07 16:29:39,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:39" (3/3) ... [2024-11-07 16:29:39,090 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-07 16:29:39,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:29:39,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-07 16:29:39,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:29:39,152 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;@70698415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:29:39,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-07 16:29:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 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) [2024-11-07 16:29:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:29:39,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:39,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:29:39,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:39,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash 4960777, now seen corresponding path program 1 times [2024-11-07 16:29:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41158247] [2024-11-07 16:29:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41158247] [2024-11-07 16:29:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41158247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:39,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103741588] [2024-11-07 16:29:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:39,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:29:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:39,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:29:39,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:29:39,329 INFO L87 Difference]: Start difference. First operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2024-11-07 16:29:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:39,358 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2024-11-07 16:29:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:29:39,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2024-11-07 16:29:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:39,368 INFO L225 Difference]: With dead ends: 195 [2024-11-07 16:29:39,368 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 16:29:39,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:29:39,373 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:39,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:29:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 16:29:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-07 16:29:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0510204081632653) internal successors, (201), 189 states have internal predecessors, (201), 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) [2024-11-07 16:29:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2024-11-07 16:29:39,427 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 4 [2024-11-07 16:29:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:39,427 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2024-11-07 16:29:39,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2024-11-07 16:29:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2024-11-07 16:29:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:29:39,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:39,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:29:39,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:29:39,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:39,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 4958341, now seen corresponding path program 1 times [2024-11-07 16:29:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:39,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602654498] [2024-11-07 16:29:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602654498] [2024-11-07 16:29:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602654498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:39,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719570404] [2024-11-07 16:29:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:39,619 INFO L87 Difference]: Start difference. First operand 193 states and 205 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) [2024-11-07 16:29:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:39,937 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2024-11-07 16:29:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:39,938 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 [2024-11-07 16:29:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:39,939 INFO L225 Difference]: With dead ends: 187 [2024-11-07 16:29:39,942 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 16:29:39,942 INFO L431 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 [2024-11-07 16:29:39,943 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:39,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:29:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 16:29:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-07 16:29:39,955 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) [2024-11-07 16:29:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-07 16:29:39,963 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 4 [2024-11-07 16:29:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-07 16:29:39,964 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) [2024-11-07 16:29:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-07 16:29:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:29:39,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:39,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:29:39,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:29:39,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:39,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 4958342, now seen corresponding path program 1 times [2024-11-07 16:29:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:39,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513061561] [2024-11-07 16:29:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:40,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513061561] [2024-11-07 16:29:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513061561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:40,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171664140] [2024-11-07 16:29:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:40,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:40,207 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) [2024-11-07 16:29:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:40,511 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2024-11-07 16:29:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:40,512 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 [2024-11-07 16:29:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:40,514 INFO L225 Difference]: With dead ends: 203 [2024-11-07 16:29:40,514 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 16:29:40,514 INFO L431 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 [2024-11-07 16:29:40,515 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 361 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:40,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 361 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:29:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 16:29:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-11-07 16:29:40,527 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) [2024-11-07 16:29:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2024-11-07 16:29:40,532 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 4 [2024-11-07 16:29:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:40,533 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2024-11-07 16:29:40,533 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) [2024-11-07 16:29:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2024-11-07 16:29:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:29:40,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:40,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:29:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:29:40,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash 153708682, now seen corresponding path program 1 times [2024-11-07 16:29:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863298315] [2024-11-07 16:29:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:40,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:40,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863298315] [2024-11-07 16:29:40,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863298315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:40,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:40,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:40,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746823540] [2024-11-07 16:29:40,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:40,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:40,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:40,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:40,597 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) [2024-11-07 16:29:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:40,729 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2024-11-07 16:29:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:40,730 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 [2024-11-07 16:29:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:40,732 INFO L225 Difference]: With dead ends: 190 [2024-11-07 16:29:40,732 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 16:29:40,732 INFO L431 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 [2024-11-07 16:29:40,733 INFO L432 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 [2024-11-07 16:29:40,733 INFO L433 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] [2024-11-07 16:29:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 16:29:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-07 16:29:40,744 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) [2024-11-07 16:29:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2024-11-07 16:29:40,745 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 5 [2024-11-07 16:29:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:40,745 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2024-11-07 16:29:40,745 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) [2024-11-07 16:29:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2024-11-07 16:29:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:29:40,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:40,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:29:40,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:29:40,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:40,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash 153708683, now seen corresponding path program 1 times [2024-11-07 16:29:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197989797] [2024-11-07 16:29:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:40,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197989797] [2024-11-07 16:29:40,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197989797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:40,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:40,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184348059] [2024-11-07 16:29:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:40,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:40,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:40,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:40,828 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) [2024-11-07 16:29:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:40,954 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2024-11-07 16:29:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:40,955 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 [2024-11-07 16:29:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:40,956 INFO L225 Difference]: With dead ends: 188 [2024-11-07 16:29:40,956 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 16:29:40,956 INFO L431 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 [2024-11-07 16:29:40,957 INFO L432 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 [2024-11-07 16:29:40,957 INFO L433 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] [2024-11-07 16:29:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 16:29:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 16:29:40,967 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) [2024-11-07 16:29:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2024-11-07 16:29:40,968 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 5 [2024-11-07 16:29:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:40,968 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2024-11-07 16:29:40,969 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) [2024-11-07 16:29:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2024-11-07 16:29:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:29:40,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:40,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:29:40,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1301215081, now seen corresponding path program 1 times [2024-11-07 16:29:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482866120] [2024-11-07 16:29:40,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482866120] [2024-11-07 16:29:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482866120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:29:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105935179] [2024-11-07 16:29:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:41,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:41,119 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) [2024-11-07 16:29:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:41,218 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2024-11-07 16:29:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:41,219 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 [2024-11-07 16:29:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:41,220 INFO L225 Difference]: With dead ends: 197 [2024-11-07 16:29:41,222 INFO L226 Difference]: Without dead ends: 197 [2024-11-07 16:29:41,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:29:41,223 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2024-11-07 16:29:41,223 INFO L433 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] [2024-11-07 16:29:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-07 16:29:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2024-11-07 16:29:41,233 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) [2024-11-07 16:29:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2024-11-07 16:29:41,235 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 10 [2024-11-07 16:29:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:41,235 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2024-11-07 16:29:41,235 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) [2024-11-07 16:29:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2024-11-07 16:29:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:29:41,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:41,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:41,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:29:41,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:41,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash -635255016, now seen corresponding path program 1 times [2024-11-07 16:29:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263992394] [2024-11-07 16:29:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:41,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263992394] [2024-11-07 16:29:41,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263992394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:41,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002116238] [2024-11-07 16:29:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:41,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:41,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:41,322 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) [2024-11-07 16:29:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:41,357 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2024-11-07 16:29:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:41,358 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 [2024-11-07 16:29:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:41,359 INFO L225 Difference]: With dead ends: 269 [2024-11-07 16:29:41,359 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 16:29:41,359 INFO L431 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 [2024-11-07 16:29:41,360 INFO L432 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 [2024-11-07 16:29:41,360 INFO L433 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] [2024-11-07 16:29:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 16:29:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2024-11-07 16:29:41,365 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) [2024-11-07 16:29:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-11-07 16:29:41,366 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 12 [2024-11-07 16:29:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:41,366 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-11-07 16:29:41,366 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) [2024-11-07 16:29:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-11-07 16:29:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:29:41,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:41,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:41,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:29:41,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:41,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937173, now seen corresponding path program 1 times [2024-11-07 16:29:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:41,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765990146] [2024-11-07 16:29:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:41,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765990146] [2024-11-07 16:29:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765990146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:41,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565332560] [2024-11-07 16:29:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:41,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:41,433 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-07 16:29:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:41,564 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2024-11-07 16:29:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:41,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-07 16:29:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:41,565 INFO L225 Difference]: With dead ends: 218 [2024-11-07 16:29:41,565 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 16:29:41,565 INFO L431 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 [2024-11-07 16:29:41,566 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 47 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 208 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 [2024-11-07 16:29:41,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 208 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:41,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 16:29:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-07 16:29:41,572 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) [2024-11-07 16:29:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 255 transitions. [2024-11-07 16:29:41,574 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 255 transitions. Word has length 13 [2024-11-07 16:29:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:41,575 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 255 transitions. [2024-11-07 16:29:41,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-07 16:29:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 255 transitions. [2024-11-07 16:29:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:29:41,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:41,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:41,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:29:41,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937174, now seen corresponding path program 1 times [2024-11-07 16:29:41,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:41,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933084162] [2024-11-07 16:29:41,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:41,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933084162] [2024-11-07 16:29:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933084162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:41,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:41,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477475179] [2024-11-07 16:29:41,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:41,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:41,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:41,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:41,698 INFO L87 Difference]: Start difference. First operand 218 states and 255 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-07 16:29:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:41,811 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2024-11-07 16:29:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-07 16:29:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:41,812 INFO L225 Difference]: With dead ends: 203 [2024-11-07 16:29:41,813 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 16:29:41,813 INFO L431 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 [2024-11-07 16:29:41,814 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 210 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 [2024-11-07 16:29:41,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 210 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 16:29:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-07 16:29:41,818 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) [2024-11-07 16:29:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2024-11-07 16:29:41,820 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 13 [2024-11-07 16:29:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:41,820 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2024-11-07 16:29:41,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-07 16:29:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2024-11-07 16:29:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:29:41,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:41,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:41,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:29:41,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:41,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961989, now seen corresponding path program 1 times [2024-11-07 16:29:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192820683] [2024-11-07 16:29:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192820683] [2024-11-07 16:29:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192820683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:41,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902413193] [2024-11-07 16:29:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:41,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:41,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:41,968 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-07 16:29:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:42,167 INFO L93 Difference]: Finished difference Result 256 states and 291 transitions. [2024-11-07 16:29:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:42,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 18 [2024-11-07 16:29:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:42,170 INFO L225 Difference]: With dead ends: 256 [2024-11-07 16:29:42,170 INFO L226 Difference]: Without dead ends: 256 [2024-11-07 16:29:42,170 INFO L431 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 [2024-11-07 16:29:42,171 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:42,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 421 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-07 16:29:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 211. [2024-11-07 16:29:42,178 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) [2024-11-07 16:29:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2024-11-07 16:29:42,181 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 18 [2024-11-07 16:29:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:42,181 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2024-11-07 16:29:42,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-07 16:29:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2024-11-07 16:29:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:29:42,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:42,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:42,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:29:42,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:42,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961990, now seen corresponding path program 1 times [2024-11-07 16:29:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902095701] [2024-11-07 16:29:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902095701] [2024-11-07 16:29:42,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902095701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:42,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:42,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:29:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404254107] [2024-11-07 16:29:42,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:42,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:29:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:29:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:42,395 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-07 16:29:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:42,598 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2024-11-07 16:29:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:29:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 18 [2024-11-07 16:29:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:42,599 INFO L225 Difference]: With dead ends: 211 [2024-11-07 16:29:42,600 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 16:29:42,600 INFO L431 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 [2024-11-07 16:29:42,600 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:42,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 436 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 16:29:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-07 16:29:42,607 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) [2024-11-07 16:29:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2024-11-07 16:29:42,608 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 18 [2024-11-07 16:29:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:42,608 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2024-11-07 16:29:42,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-07 16:29:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2024-11-07 16:29:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:29:42,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:42,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:29:42,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431927, now seen corresponding path program 1 times [2024-11-07 16:29:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879075597] [2024-11-07 16:29:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:42,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879075597] [2024-11-07 16:29:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879075597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:42,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849464747] [2024-11-07 16:29:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:42,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:42,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:42,855 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) [2024-11-07 16:29:42,857 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 [2024-11-07 16:29:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:42,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 16:29:42,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:43,017 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:29:43,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:29:43,062 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 [2024-11-07 16:29:43,165 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:29:43,165 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 [2024-11-07 16:29:43,218 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 [2024-11-07 16:29:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:29:43,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:43,330 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse0) v_ArrVal_162) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2024-11-07 16:29:43,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:43,348 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 [2024-11-07 16:29:43,351 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 [2024-11-07 16:29:43,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-07 16:29:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:29:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849464747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:43,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:43,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-07 16:29:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515962509] [2024-11-07 16:29:43,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:43,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:29:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:29:43,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2024-11-07 16:29:43,385 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 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) [2024-11-07 16:29:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:43,689 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2024-11-07 16:29:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 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 [2024-11-07 16:29:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:43,690 INFO L225 Difference]: With dead ends: 212 [2024-11-07 16:29:43,690 INFO L226 Difference]: Without dead ends: 212 [2024-11-07 16:29:43,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2024-11-07 16:29:43,691 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 44 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:43,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 645 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 367 Invalid, 0 Unknown, 93 Unchecked, 0.3s Time] [2024-11-07 16:29:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-07 16:29:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-11-07 16:29:43,696 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) [2024-11-07 16:29:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2024-11-07 16:29:43,697 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 24 [2024-11-07 16:29:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:43,698 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2024-11-07 16:29:43,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 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) [2024-11-07 16:29:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2024-11-07 16:29:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:29:43,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:43,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:43,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:29:43,900 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,SelfDestructingSolverStorable11 [2024-11-07 16:29:43,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431926, now seen corresponding path program 1 times [2024-11-07 16:29:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958392585] [2024-11-07 16:29:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:44,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958392585] [2024-11-07 16:29:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958392585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165560764] [2024-11-07 16:29:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:44,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:44,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:44,308 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) [2024-11-07 16:29:44,310 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 [2024-11-07 16:29:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:44,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:29:44,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:44,435 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 [2024-11-07 16:29:44,446 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 [2024-11-07 16:29:44,474 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 [2024-11-07 16:29:44,484 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 [2024-11-07 16:29:44,635 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:29:44,635 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 [2024-11-07 16:29:44,645 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 [2024-11-07 16:29:44,728 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 [2024-11-07 16:29:44,738 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 [2024-11-07 16:29:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:44,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:44,880 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_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) 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_221) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-07 16:29:44,917 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_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2024-11-07 16:29:44,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-07 16:29:44,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:44,959 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 [2024-11-07 16:29:44,964 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 [2024-11-07 16:29:44,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:44,978 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 [2024-11-07 16:29:44,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:44,988 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 [2024-11-07 16:29:44,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:29:44,996 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 [2024-11-07 16:29:45,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:29:45,004 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 [2024-11-07 16:29:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-07 16:29:45,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165560764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:45,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:45,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2024-11-07 16:29:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227383702] [2024-11-07 16:29:45,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:45,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:29:45,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:45,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:29:45,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2024-11-07 16:29:45,039 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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) [2024-11-07 16:29:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:45,525 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2024-11-07 16:29:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:29:45,525 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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 [2024-11-07 16:29:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:45,526 INFO L225 Difference]: With dead ends: 222 [2024-11-07 16:29:45,527 INFO L226 Difference]: Without dead ends: 222 [2024-11-07 16:29:45,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=368, Unknown=3, NotChecked=126, Total=600 [2024-11-07 16:29:45,527 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 16 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:45,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 982 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 482 Invalid, 0 Unknown, 248 Unchecked, 0.4s Time] [2024-11-07 16:29:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-07 16:29:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-11-07 16:29:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 217 states have internal predecessors, (239), 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) [2024-11-07 16:29:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2024-11-07 16:29:45,537 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 24 [2024-11-07 16:29:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:45,538 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2024-11-07 16:29:45,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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) [2024-11-07 16:29:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2024-11-07 16:29:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:29:45,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:45,539 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:45,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:29:45,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:45,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:45,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1476739250, now seen corresponding path program 2 times [2024-11-07 16:29:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:45,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606906290] [2024-11-07 16:29:45,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:45,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606906290] [2024-11-07 16:29:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606906290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717784464] [2024-11-07 16:29:46,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:29:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:46,235 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) [2024-11-07 16:29:46,237 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 [2024-11-07 16:29:46,349 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:29:46,349 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:29:46,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 16:29:46,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:46,382 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 [2024-11-07 16:29:46,389 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 [2024-11-07 16:29:46,413 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 [2024-11-07 16:29:46,417 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 [2024-11-07 16:29:46,538 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:29:46,539 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 [2024-11-07 16:29:46,544 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 [2024-11-07 16:29:46,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:29:46,661 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 [2024-11-07 16:29:46,669 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 [2024-11-07 16:29:46,731 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 [2024-11-07 16:29:46,737 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 [2024-11-07 16:29:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:46,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:46,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-11-07 16:29:46,960 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-07 16:29:46,982 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_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_295))) (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_294) .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= 0 (+ (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_295) c_create_data_~data~0.base) .cse1) v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2024-11-07 16:29:47,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:47,175 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 46 treesize of output 47 [2024-11-07 16:29:47,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:47,183 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 36 treesize of output 37 [2024-11-07 16:29:47,187 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 64 treesize of output 52 [2024-11-07 16:29:47,191 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 134 treesize of output 116 [2024-11-07 16:29:47,201 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 28 [2024-11-07 16:29:47,205 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 13 treesize of output 9 [2024-11-07 16:29:47,209 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 [2024-11-07 16:29:47,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:47,222 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 89 treesize of output 90 [2024-11-07 16:29:47,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:47,230 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 79 treesize of output 60 [2024-11-07 16:29:47,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:29:47,235 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 92 treesize of output 56 [2024-11-07 16:29:47,238 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:29:47,240 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 [2024-11-07 16:29:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-07 16:29:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717784464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:47,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2024-11-07 16:29:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343323263] [2024-11-07 16:29:47,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:47,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-07 16:29:47,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-07 16:29:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=514, Unknown=23, NotChecked=150, Total=812 [2024-11-07 16:29:47,277 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 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) [2024-11-07 16:29:47,816 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)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3)) (.cse1 (* c_create_data_~counter~0 4))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_297) c_create_data_~data~0.base) .cse3) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_296) c_create_data_~data~0.base) .cse3)))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_297) c_create_data_~data~0.base) .cse3) .cse1 4)))))) is different from false [2024-11-07 16:29:47,830 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_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) 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_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse1) 4))) (<= 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 [2024-11-07 16:29:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:48,361 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2024-11-07 16:29:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:29:48,362 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 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 30 [2024-11-07 16:29:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:48,363 INFO L225 Difference]: With dead ends: 258 [2024-11-07 16:29:48,363 INFO L226 Difference]: Without dead ends: 258 [2024-11-07 16:29:48,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=778, Unknown=29, NotChecked=320, Total=1332 [2024-11-07 16:29:48,364 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 20 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 3 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:48,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1164 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 675 Invalid, 29 Unknown, 417 Unchecked, 0.8s Time] [2024-11-07 16:29:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-07 16:29:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-07 16:29:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.374384236453202) internal successors, (279), 253 states have internal predecessors, (279), 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) [2024-11-07 16:29:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2024-11-07 16:29:48,370 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 30 [2024-11-07 16:29:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:48,371 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2024-11-07 16:29:48,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 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) [2024-11-07 16:29:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2024-11-07 16:29:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 16:29:48,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:48,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-07 16:29:48,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:29:48,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:48,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:48,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1663613620, now seen corresponding path program 1 times [2024-11-07 16:29:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:48,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218388776] [2024-11-07 16:29:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:48,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:48,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218388776] [2024-11-07 16:29:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218388776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:48,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122719656] [2024-11-07 16:29:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:48,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:48,667 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) [2024-11-07 16:29:48,668 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 [2024-11-07 16:29:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:48,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:29:48,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:48,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:48,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122719656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:48,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:48,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 16:29:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132637862] [2024-11-07 16:29:48,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:48,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:29:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:29:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:29:48,886 INFO L87 Difference]: Start difference. First operand 258 states and 283 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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) [2024-11-07 16:29:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:48,929 INFO L93 Difference]: Finished difference Result 288 states and 313 transitions. [2024-11-07 16:29:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:29:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 43 [2024-11-07 16:29:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:48,932 INFO L225 Difference]: With dead ends: 288 [2024-11-07 16:29:48,932 INFO L226 Difference]: Without dead ends: 288 [2024-11-07 16:29:48,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:29:48,932 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 10 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:48,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 649 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:29:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-07 16:29:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-07 16:29:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.3261802575107295) internal successors, (309), 283 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) [2024-11-07 16:29:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 313 transitions. [2024-11-07 16:29:48,943 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 313 transitions. Word has length 43 [2024-11-07 16:29:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 313 transitions. [2024-11-07 16:29:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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) [2024-11-07 16:29:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 313 transitions. [2024-11-07 16:29:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:29:48,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:48,946 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:48,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:29:49,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 16:29:49,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:29:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2035025446, now seen corresponding path program 3 times [2024-11-07 16:29:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009011432] [2024-11-07 16:29:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:50,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009011432] [2024-11-07 16:29:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009011432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:50,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457524634] [2024-11-07 16:29:50,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:29:50,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:50,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:50,150 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) [2024-11-07 16:29:50,152 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 [2024-11-07 16:29:50,442 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-07 16:29:50,442 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:29:50,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-07 16:29:50,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:50,474 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 [2024-11-07 16:29:50,478 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 [2024-11-07 16:29:50,481 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 [2024-11-07 16:29:50,515 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 [2024-11-07 16:29:50,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:29:50,683 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:29:50,684 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 [2024-11-07 16:29:50,692 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 [2024-11-07 16:29:50,863 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:29:50,863 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 [2024-11-07 16:29:50,869 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 [2024-11-07 16:29:51,018 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:29:51,018 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 [2024-11-07 16:29:51,026 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 [2024-11-07 16:29:51,188 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:29:51,188 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 [2024-11-07 16:29:51,195 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 [2024-11-07 16:29:51,371 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:29:51,371 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 [2024-11-07 16:29:51,377 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 [2024-11-07 16:29:51,469 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 [2024-11-07 16:29:51,474 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 7 treesize of output 3 [2024-11-07 16:29:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:51,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:51,759 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-07 16:29:52,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (< (+ (mod (+ (* 3 .cse0) 3) 4) .cse0) (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4) 12))) (< c_create_data_~counter~0 (div (+ (- 1) (* (- 1) .cse0)) 4)))))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse9 (* c_create_data_~counter~0 4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_501))) (or (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_500))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_503))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store (store .cse6 .cse7 v_ArrVal_502) .cse8 v_ArrVal_504) c_create_data_~data~0.base) .cse4) .cse9 15) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_505) c_create_data_~data~0.base) .cse4)))))))) (< (+ .cse9 4 (select (select .cse6 c_create_data_~data~0.base) .cse4)) 0))))))) is different from false [2024-11-07 16:29:52,430 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_501)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ .cse0 8 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_500))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_503))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (< (+ 19 (select (select (store (store .cse1 .cse3 v_ArrVal_502) .cse4 v_ArrVal_504) c_create_data_~data~0.base) .cse2) .cse0) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_505) c_create_data_~data~0.base) .cse2)))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_501))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (or (< (+ (mod (+ (* 3 .cse8) 3) 4) .cse8) (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_500))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (store (store .cse9 .cse10 v_ArrVal_502) (select (select (store .cse11 .cse10 v_ArrVal_503) c_create_data_~data~0.base) .cse2) v_ArrVal_504))) c_create_data_~data~0.base) .cse2) 12)) (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse8)) 4))))))))) is different from false [2024-11-07 16:29:52,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_499))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_498) .cse6 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ .cse0 (mod (+ 3 (* .cse0 3)) 4)) (+ 12 (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_499))) (let ((.cse14 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_498) .cse14 v_ArrVal_501))) (or (< (+ (select (select .cse7 c_create_data_~data~0.base) .cse4) .cse8 8) 0) (let ((.cse12 (store .cse13 .cse14 v_ArrVal_500))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_503))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (< (+ 19 .cse8 (select (select (store (store .cse7 .cse9 v_ArrVal_502) .cse10 v_ArrVal_504) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_505) c_create_data_~data~0.base) .cse4)))))))))))))) is different from false [2024-11-07 16:29:52,567 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse8 v_ArrVal_501)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ .cse0 8 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_500))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_503))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store (store .cse1 .cse3 v_ArrVal_502) .cse4 v_ArrVal_504) c_create_data_~data~0.base) .cse2) 19 .cse0) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_505) c_create_data_~data~0.base) .cse2)))))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse15 v_ArrVal_501))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse10)) 4)) (< (+ (mod (+ 3 (* 3 .cse10)) 4) .cse10) (+ (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_500))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (store (store .cse11 .cse12 v_ArrVal_502) (select (select (store .cse13 .cse12 v_ArrVal_503) c_create_data_~data~0.base) .cse2) v_ArrVal_504))) c_create_data_~data~0.base) .cse2) 12))))))))))) is different from false [2024-11-07 16:29:52,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse8 v_ArrVal_501))) (or (let ((.cse6 (store .cse7 .cse8 v_ArrVal_500))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_503))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store (store .cse0 .cse1 v_ArrVal_502) .cse2 v_ArrVal_504) c_create_data_~data~0.base) .cse3) 23 .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_505) c_create_data_~data~0.base) .cse3))))))) (< (+ .cse4 (select (select .cse0 c_create_data_~data~0.base) .cse3) 12) 0)))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse15 v_ArrVal_501))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (or (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse10)) 4)) (< (+ (mod (+ 3 (* 3 .cse10)) 4) .cse10) (+ (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_500))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (store (store .cse11 .cse12 v_ArrVal_502) (select (select (store .cse13 .cse12 v_ArrVal_503) c_create_data_~data~0.base) .cse3) v_ArrVal_504))) c_create_data_~data~0.base) .cse3) 12))))))))))) is different from false [2024-11-07 16:29:52,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_497))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_499))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_496) .cse7 v_ArrVal_498) .cse6 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4) 12)))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_497))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_499))) (let ((.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_496) .cse17 v_ArrVal_498) .cse16 v_ArrVal_501)) (.cse12 (* c_create_data_~counter~0 4))) (or (let ((.cse14 (store .cse15 .cse16 v_ArrVal_500))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_503))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store (store .cse9 .cse10 v_ArrVal_502) .cse11 v_ArrVal_504) c_create_data_~data~0.base) .cse4) 23 .cse12) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_505) c_create_data_~data~0.base) .cse4))))))) (< (+ (select (select .cse9 c_create_data_~data~0.base) .cse4) .cse12 12) 0)))))))))) is different from false [2024-11-07 16:29:52,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_497))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_499))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_496) .cse8 v_ArrVal_498) .cse6 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ 12 (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4))) (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_497))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_499))) (let ((.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (* c_create_data_~counter~0 4)) (.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_496) .cse18 v_ArrVal_498) .cse17 v_ArrVal_501))) (or (< (+ (select (select .cse10 c_create_data_~data~0.base) .cse4) .cse11 12) 0) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_500))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_503))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (< (+ 23 .cse11 (select (select (store (store .cse10 .cse12 v_ArrVal_502) .cse13 v_ArrVal_504) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_505) c_create_data_~data~0.base) .cse4))))))))))))))))) is different from false [2024-11-07 16:29:53,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:53,443 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 796 treesize of output 786 [2024-11-07 16:29:53,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:53,457 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 776 treesize of output 446 [2024-11-07 16:29:54,262 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 124914397 treesize of output 106879369 [2024-11-07 16:29:59,499 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 10888 DAG size of output: 186 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 16:29:59,595 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 1886027 treesize of output 1874999 [2024-11-07 16:29:59,699 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 461 treesize of output 401 [2024-11-07 16:29:59,705 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 401 treesize of output 389 [2024-11-07 16:29:59,712 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 389 treesize of output 345 [2024-11-07 16:29:59,719 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 345 treesize of output 325 [2024-11-07 16:29:59,723 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 393 treesize of output 385 [2024-11-07 16:29:59,726 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 385 treesize of output 337 [2024-11-07 16:29:59,731 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 337 treesize of output 329 [2024-11-07 16:29:59,736 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 329 treesize of output 289 [2024-11-07 16:29:59,741 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 289 treesize of output 281 [2024-11-07 16:29:59,746 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 241 treesize of output 233 [2024-11-07 16:29:59,887 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-07 16:29:59,887 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 627 treesize of output 1 [2024-11-07 16:29:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 18 refuted. 2 times theorem prover too weak. 0 trivial. 60 not checked. [2024-11-07 16:29:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457524634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:59,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20] total 50 [2024-11-07 16:29:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610120676] [2024-11-07 16:29:59,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:59,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-07 16:29:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:59,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-07 16:29:59,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1497, Unknown=44, NotChecked=712, Total=2550 [2024-11-07 16:29:59,936 INFO L87 Difference]: Start difference. First operand 288 states and 313 transitions. Second operand has 51 states, 50 states have (on average 2.42) internal successors, (121), 51 states have internal predecessors, (121), 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) [2024-11-07 16:30:03,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:30:07,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:30:08,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse3 (+ .cse4 .cse2 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 8))) (<= 0 .cse3) (<= (+ .cse4 .cse2 8) (select |c_#length| .cse0)) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 4))) (or (< c_create_data_~counter~0 (div (+ (- 1) (* .cse4 (- 1))) 4)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (< (+ .cse4 (mod (+ 3 (* .cse4 3)) 4)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_502) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_503) c_create_data_~data~0.base) .cse1) v_ArrVal_504) c_create_data_~data~0.base) .cse1) 12)))) (or (< .cse3 0) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_503))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (< (+ .cse2 15 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_502) .cse5 v_ArrVal_504) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_505) c_create_data_~data~0.base) .cse1))))))))))) is different from false [2024-11-07 16:30:08,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse3 (+ .cse4 .cse2 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 8))) (<= 0 .cse3) (<= (+ .cse4 .cse2 8) (select |c_#length| .cse0)) (or (< c_create_data_~counter~0 (div (+ (- 1) (* .cse4 (- 1))) 4)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (< (+ .cse4 (mod (+ 3 (* .cse4 3)) 4)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_502) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_503) c_create_data_~data~0.base) .cse1) v_ArrVal_504) c_create_data_~data~0.base) .cse1) 12)))) (or (< .cse3 0) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_503))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (< (+ .cse2 15 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_502) .cse5 v_ArrVal_504) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_505) c_create_data_~data~0.base) .cse1))))))))))) is different from false [2024-11-07 16:30:08,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse4)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4)) (.cse0 (+ .cse1 .cse2))) (and (<= 0 .cse0) (<= (+ .cse1 .cse2 4) (select |c_#length| .cse3)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_504) c_create_data_~data~0.base) .cse4) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_505) c_create_data_~data~0.base) .cse4)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_504) c_create_data_~data~0.base) .cse4) .cse2 4))) (or (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_503))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_502) .cse5 v_ArrVal_504) c_create_data_~data~0.base) .cse4) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_505) c_create_data_~data~0.base) .cse4)))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_502) (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504) c_create_data_~data~0.base) .cse4) 8)))) (< .cse0 0)))))) is different from false [2024-11-07 16:30:08,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4))) (let ((.cse0 (+ |c_create_data_#t~mem8.offset| .cse1)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_502) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_503) c_create_data_~data~0.base) .cse2) v_ArrVal_504) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_503))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ .cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_502) .cse3 v_ArrVal_504) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_505) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_504) c_create_data_~data~0.base) .cse2) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_505) c_create_data_~data~0.base) .cse2)))) (<= 0 .cse0) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_504) c_create_data_~data~0.base) .cse2) .cse1 4))) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2024-11-07 16:30:08,490 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)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3)) (.cse1 (* c_create_data_~counter~0 4))) (and (<= 0 (+ .cse0 .cse1)) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_504) c_create_data_~data~0.base) .cse3) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_505) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_504) c_create_data_~data~0.base) .cse3) .cse1 4)))))) is different from false [2024-11-07 16:30:08,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_504) 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_505) c_create_data_~data~0.base) .cse0)))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse1)) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_504) c_create_data_~data~0.base) .cse0) .cse1 4))) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2024-11-07 16:30:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:10,379 INFO L93 Difference]: Finished difference Result 318 states and 343 transitions. [2024-11-07 16:30:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 16:30:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.42) internal successors, (121), 51 states have internal predecessors, (121), 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 48 [2024-11-07 16:30:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:10,382 INFO L225 Difference]: With dead ends: 318 [2024-11-07 16:30:10,382 INFO L226 Difference]: Without dead ends: 318 [2024-11-07 16:30:10,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=629, Invalid=2787, Unknown=62, NotChecked=1778, Total=5256 [2024-11-07 16:30:10,386 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 55 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 16 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 3052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 1492 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:10,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2331 Invalid, 3052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1530 Invalid, 14 Unknown, 1492 Unchecked, 8.6s Time] [2024-11-07 16:30:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-07 16:30:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-07 16:30:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 263 states have (on average 1.2889733840304183) internal successors, (339), 313 states have internal predecessors, (339), 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) [2024-11-07 16:30:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 343 transitions. [2024-11-07 16:30:10,394 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 343 transitions. Word has length 48 [2024-11-07 16:30:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:10,394 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 343 transitions. [2024-11-07 16:30:10,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.42) internal successors, (121), 51 states have internal predecessors, (121), 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) [2024-11-07 16:30:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 343 transitions. [2024-11-07 16:30:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 16:30:10,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:10,399 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2024-11-07 16:30:10,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:30:10,599 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 [2024-11-07 16:30:10,600 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:30:10,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1384372064, now seen corresponding path program 2 times [2024-11-07 16:30:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:10,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520925741] [2024-11-07 16:30:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520925741] [2024-11-07 16:30:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520925741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829180552] [2024-11-07 16:30:10,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:30:10,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:10,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:10,983 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) [2024-11-07 16:30:10,985 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 [2024-11-07 16:30:11,110 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:30:11,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:30:11,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:30:11,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:11,132 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 [2024-11-07 16:30:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-07 16:30:11,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:30:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829180552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:11,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:30:11,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2024-11-07 16:30:11,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386478669] [2024-11-07 16:30:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:11,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:30:11,173 INFO L87 Difference]: Start difference. First operand 318 states and 343 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) [2024-11-07 16:30:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:11,406 INFO L93 Difference]: Finished difference Result 316 states and 339 transitions. [2024-11-07 16:30:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:11,407 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 73 [2024-11-07 16:30:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:11,408 INFO L225 Difference]: With dead ends: 316 [2024-11-07 16:30:11,408 INFO L226 Difference]: Without dead ends: 316 [2024-11-07 16:30:11,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:30:11,409 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:11,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 244 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-07 16:30:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-07 16:30:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 263 states have (on average 1.273764258555133) internal successors, (335), 311 states have internal predecessors, (335), 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) [2024-11-07 16:30:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 339 transitions. [2024-11-07 16:30:11,415 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 339 transitions. Word has length 73 [2024-11-07 16:30:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:11,416 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 339 transitions. [2024-11-07 16:30:11,416 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) [2024-11-07 16:30:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 339 transitions. [2024-11-07 16:30:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 16:30:11,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:11,418 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2024-11-07 16:30:11,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:11,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 16:30:11,622 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:30:11,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1384372065, now seen corresponding path program 1 times [2024-11-07 16:30:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219410188] [2024-11-07 16:30:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-07 16:30:11,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219410188] [2024-11-07 16:30:11,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219410188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:11,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:11,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:11,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686477476] [2024-11-07 16:30:11,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:11,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:11,734 INFO L87 Difference]: Start difference. First operand 316 states and 339 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) [2024-11-07 16:30:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:11,923 INFO L93 Difference]: Finished difference Result 314 states and 335 transitions. [2024-11-07 16:30:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:11,923 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 73 [2024-11-07 16:30:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:11,925 INFO L225 Difference]: With dead ends: 314 [2024-11-07 16:30:11,925 INFO L226 Difference]: Without dead ends: 314 [2024-11-07 16:30:11,925 INFO L431 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 [2024-11-07 16:30:11,925 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 6 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:11,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-07 16:30:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-11-07 16:30:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 263 states have (on average 1.258555133079848) internal successors, (331), 309 states have internal predecessors, (331), 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) [2024-11-07 16:30:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 335 transitions. [2024-11-07 16:30:11,932 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 335 transitions. Word has length 73 [2024-11-07 16:30:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:11,932 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 335 transitions. [2024-11-07 16:30:11,932 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) [2024-11-07 16:30:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 335 transitions. [2024-11-07 16:30:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 16:30:11,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:11,933 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:11,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:30:11,933 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:30:11,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1349591326, now seen corresponding path program 1 times [2024-11-07 16:30:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113950054] [2024-11-07 16:30:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 16:30:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113950054] [2024-11-07 16:30:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113950054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764787086] [2024-11-07 16:30:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:12,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:12,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:12,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 16:30:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:12,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 16:30:12,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:12,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764787086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:13,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2024-11-07 16:30:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447789] [2024-11-07 16:30:13,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:13,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:30:13,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:30:13,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2024-11-07 16:30:13,282 INFO L87 Difference]: Start difference. First operand 314 states and 335 transitions. Second operand has 22 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:30:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:13,669 INFO L93 Difference]: Finished difference Result 406 states and 437 transitions. [2024-11-07 16:30:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 16:30:13,670 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2024-11-07 16:30:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:13,671 INFO L225 Difference]: With dead ends: 406 [2024-11-07 16:30:13,671 INFO L226 Difference]: Without dead ends: 406 [2024-11-07 16:30:13,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2024-11-07 16:30:13,672 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:13,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 697 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:30:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-07 16:30:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2024-11-07 16:30:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 353 states have (on average 1.2209631728045325) internal successors, (431), 399 states have internal predecessors, (431), 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) [2024-11-07 16:30:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 435 transitions. [2024-11-07 16:30:13,680 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 435 transitions. Word has length 78 [2024-11-07 16:30:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:13,680 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 435 transitions. [2024-11-07 16:30:13,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:30:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 435 transitions. [2024-11-07 16:30:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 16:30:13,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:13,681 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:13,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:13,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:13,882 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 16:30:13,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1261723502, now seen corresponding path program 4 times [2024-11-07 16:30:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192975930] [2024-11-07 16:30:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:16,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192975930] [2024-11-07 16:30:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192975930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:16,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979233392] [2024-11-07 16:30:16,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 16:30:16,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:16,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:16,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 16:30:16,866 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 16:30:16,866 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:30:16,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-07 16:30:16,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:16,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-07 16:30:16,901 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 [2024-11-07 16:30:16,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:16,991 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 [2024-11-07 16:30:17,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:17,295 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 [2024-11-07 16:30:17,313 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 [2024-11-07 16:30:17,552 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:17,552 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 [2024-11-07 16:30:17,575 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 [2024-11-07 16:30:17,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:17,874 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 [2024-11-07 16:30:17,878 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 [2024-11-07 16:30:18,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:18,142 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 [2024-11-07 16:30:18,148 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 [2024-11-07 16:30:18,396 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:18,397 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 [2024-11-07 16:30:18,406 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 [2024-11-07 16:30:18,666 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:18,666 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 [2024-11-07 16:30:18,678 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 [2024-11-07 16:30:18,920 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:18,920 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 [2024-11-07 16:30:18,929 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 [2024-11-07 16:30:19,185 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:19,185 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 [2024-11-07 16:30:19,207 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 43 treesize of output 24 [2024-11-07 16:30:19,591 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:19,592 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 [2024-11-07 16:30:19,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2024-11-07 16:30:19,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:19,997 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 95 treesize of output 88 [2024-11-07 16:30:20,006 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 76 treesize of output 54 [2024-11-07 16:30:20,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-07 16:30:20,216 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 [2024-11-07 16:30:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:20,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:21,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_1165 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_1165))) (let ((.cse2 (+ .cse3 8 (select (select .cse0 c_create_data_~data~0.base) .cse4)))) (or (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_1166))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (or (not (= v_ArrVal_1167 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1167 .cse2)))) (forall ((v_ArrVal_1168 (Array Int Int))) (<= (+ 16 .cse3 (select (select (store .cse0 .cse1 v_ArrVal_1167) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse1 v_ArrVal_1168) c_create_data_~data~0.base) .cse4)))))))) (< .cse2 0))))) (forall ((v_ArrVal_1165 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_1165))) (let ((.cse7 (+ .cse3 8 (select (select .cse8 c_create_data_~data~0.base) .cse4)))) (or (< .cse7 0) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (or (< 0 (+ .cse3 (select (select (store .cse8 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_1166) c_create_data_~data~0.base) .cse4) v_ArrVal_1167) c_create_data_~data~0.base) .cse4) 13)) (not (= v_ArrVal_1167 (store v_ArrVal_1165 .cse7 (select v_ArrVal_1167 .cse7))))))))))))) is different from false [2024-11-07 16:30:29,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (+ c_create_data_~counter~0 2)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_create_data_~counter~0_81 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1161))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse8 (store .cse12 .cse10 v_ArrVal_1164))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1162)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse1))) (let ((.cse4 (store (store .cse0 .cse10 v_ArrVal_1163) .cse9 v_ArrVal_1165)) (.cse2 (* v_create_data_~counter~0_81 4)) (.cse6 (store .cse8 .cse9 v_ArrVal_1166))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse1)) (.cse7 (+ (select (select .cse4 c_create_data_~data~0.base) .cse1) 8 .cse2))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2) 0) (< .cse3 v_create_data_~counter~0_81) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_1167) c_create_data_~data~0.base) .cse1) 15 .cse2) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1168) c_create_data_~data~0.base) .cse1))) (not (= v_ArrVal_1167 (store (select .cse4 .cse5) .cse7 (select v_ArrVal_1167 .cse7)))) (< .cse7 0))))))))) (forall ((v_create_data_~counter~0_81 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1161))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse14 (store .cse20 .cse19 v_ArrVal_1164))) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1162)) (.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store (store .cse17 .cse19 v_ArrVal_1163) .cse15 v_ArrVal_1165)) (.cse16 (* v_create_data_~counter~0_81 4))) (let ((.cse18 (+ (select (select .cse13 c_create_data_~data~0.base) .cse1) 8 .cse16))) (or (< 0 (+ (select (select (store .cse13 (select (select (store .cse14 .cse15 v_ArrVal_1166) c_create_data_~data~0.base) .cse1) v_ArrVal_1167) c_create_data_~data~0.base) .cse1) .cse16 13)) (< (+ (select (select .cse17 c_create_data_~data~0.base) .cse1) .cse16) 0) (not (= (store v_ArrVal_1165 .cse18 (select v_ArrVal_1167 .cse18)) v_ArrVal_1167)) (< .cse3 v_create_data_~counter~0_81) (< .cse18 0)))))))))))) is different from false [2024-11-07 16:30:29,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~counter~0 2)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1160))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store .cse13 .cse11 v_ArrVal_1161))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse8 (store .cse12 .cse10 v_ArrVal_1164))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1159) .cse11 v_ArrVal_1162)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse1))) (let ((.cse4 (store (store .cse0 .cse10 v_ArrVal_1163) .cse9 v_ArrVal_1165)) (.cse2 (* v_create_data_~counter~0_81 4)) (.cse7 (store .cse8 .cse9 v_ArrVal_1166))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse1)) (.cse6 (+ (select (select .cse4 c_create_data_~data~0.base) .cse1) 8 .cse2))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2) 0) (< .cse3 v_create_data_~counter~0_81) (not (= (store (select .cse4 .cse5) .cse6 (select v_ArrVal_1167 .cse6)) v_ArrVal_1167)) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_1167) c_create_data_~data~0.base) .cse1) 15 .cse2) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1168) c_create_data_~data~0.base) .cse1))) (< .cse6 0))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1160))) (let ((.cse21 (select (select .cse23 c_create_data_~data~0.base) .cse1))) (let ((.cse22 (store .cse23 .cse21 v_ArrVal_1161))) (let ((.cse20 (select (select .cse22 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse22 .cse20 v_ArrVal_1164))) (let ((.cse15 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1159) .cse21 v_ArrVal_1162)) (.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store (store .cse15 .cse20 v_ArrVal_1163) .cse19 v_ArrVal_1165)) (.cse16 (* v_create_data_~counter~0_81 4))) (let ((.cse14 (+ (select (select .cse17 c_create_data_~data~0.base) .cse1) 8 .cse16))) (or (not (= (store v_ArrVal_1165 .cse14 (select v_ArrVal_1167 .cse14)) v_ArrVal_1167)) (< (+ (select (select .cse15 c_create_data_~data~0.base) .cse1) .cse16) 0) (< .cse3 v_create_data_~counter~0_81) (< 0 (+ (select (select (store .cse17 (select (select (store .cse18 .cse19 v_ArrVal_1166) c_create_data_~data~0.base) .cse1) v_ArrVal_1167) c_create_data_~data~0.base) .cse1) .cse16 13)) (< .cse14 0))))))))))))) is different from false [2024-11-07 16:30:30,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse6 (+ c_create_data_~counter~0 2)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1160))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse10 v_ArrVal_1161))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse11 .cse8 v_ArrVal_1164))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1159) .cse10 v_ArrVal_1162)) (.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store .cse7 .cse8 v_ArrVal_1163) .cse3 v_ArrVal_1165)) (.cse5 (* v_create_data_~counter~0_81 4))) (let ((.cse0 (+ (select (select .cse1 c_create_data_~data~0.base) .cse4) 8 .cse5))) (or (not (= (store v_ArrVal_1165 .cse0 (select v_ArrVal_1167 .cse0)) v_ArrVal_1167)) (< 0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_1166) c_create_data_~data~0.base) .cse4) v_ArrVal_1167) c_create_data_~data~0.base) .cse4) .cse5 13)) (< .cse6 v_create_data_~counter~0_81) (< .cse0 0) (< (+ .cse5 (select (select .cse7 c_create_data_~data~0.base) .cse4)) 0))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1160))) (let ((.cse22 (select (select .cse24 c_create_data_~data~0.base) .cse4))) (let ((.cse23 (store .cse24 .cse22 v_ArrVal_1161))) (let ((.cse21 (select (select .cse23 c_create_data_~data~0.base) .cse4))) (let ((.cse19 (store .cse23 .cse21 v_ArrVal_1164))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1159) .cse22 v_ArrVal_1162)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store (store .cse18 .cse21 v_ArrVal_1163) .cse20 v_ArrVal_1165)) (.cse15 (* v_create_data_~counter~0_81 4)) (.cse16 (store .cse19 .cse20 v_ArrVal_1166))) (let ((.cse14 (select (select .cse16 c_create_data_~data~0.base) .cse4)) (.cse17 (+ (select (select .cse13 c_create_data_~data~0.base) .cse4) 8 .cse15))) (or (< (+ (select (select (store .cse13 .cse14 v_ArrVal_1167) c_create_data_~data~0.base) .cse4) 15 .cse15) (select |c_#length| (select (select (store .cse16 .cse14 v_ArrVal_1168) c_create_data_~data~0.base) .cse4))) (< .cse6 v_create_data_~counter~0_81) (< .cse17 0) (< (+ .cse15 (select (select .cse18 c_create_data_~data~0.base) .cse4)) 0) (not (= v_ArrVal_1167 (store (select .cse13 .cse14) .cse17 (select v_ArrVal_1167 .cse17))))))))))))))))) is different from false [2024-11-07 16:30:30,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 3)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1160))) (let ((.cse12 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (store .cse14 .cse12 v_ArrVal_1161))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (let ((.cse8 (store .cse13 .cse10 v_ArrVal_1164))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1159) .cse12 v_ArrVal_1162)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (let ((.cse0 (store (store .cse6 .cse10 v_ArrVal_1163) .cse9 v_ArrVal_1165)) (.cse3 (* v_create_data_~counter~0_81 4)) (.cse4 (store .cse8 .cse9 v_ArrVal_1166))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2)) (.cse5 (+ (select (select .cse0 c_create_data_~data~0.base) .cse2) 8 .cse3))) (or (< (+ (select (select (store .cse0 .cse1 v_ArrVal_1167) c_create_data_~data~0.base) .cse2) 15 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1168) c_create_data_~data~0.base) .cse2))) (< .cse5 0) (< (+ .cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2)) 0) (not (= v_ArrVal_1167 (store (select .cse0 .cse1) .cse5 (select v_ArrVal_1167 .cse5)))) (< .cse7 v_create_data_~counter~0_81))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1160))) (let ((.cse22 (select (select .cse24 c_create_data_~data~0.base) .cse2))) (let ((.cse23 (store .cse24 .cse22 v_ArrVal_1161))) (let ((.cse21 (select (select .cse23 c_create_data_~data~0.base) .cse2))) (let ((.cse17 (store .cse23 .cse21 v_ArrVal_1164))) (let ((.cse20 (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1159) .cse22 v_ArrVal_1162)) (.cse18 (select (select .cse17 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store (store .cse20 .cse21 v_ArrVal_1163) .cse18 v_ArrVal_1165)) (.cse19 (* v_create_data_~counter~0_81 4))) (let ((.cse15 (+ (select (select .cse16 c_create_data_~data~0.base) .cse2) 8 .cse19))) (or (not (= (store v_ArrVal_1165 .cse15 (select v_ArrVal_1167 .cse15)) v_ArrVal_1167)) (< 0 (+ (select (select (store .cse16 (select (select (store .cse17 .cse18 v_ArrVal_1166) c_create_data_~data~0.base) .cse2) v_ArrVal_1167) c_create_data_~data~0.base) .cse2) .cse19 13)) (< .cse15 0) (< (+ .cse19 (select (select .cse20 c_create_data_~data~0.base) .cse2)) 0) (< .cse7 v_create_data_~counter~0_81)))))))))))))) is different from false [2024-11-07 16:30:35,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~counter~0 3)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1158))) (let ((.cse9 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (let ((.cse12 (store .cse13 .cse9 v_ArrVal_1160))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store .cse12 .cse10 v_ArrVal_1161))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (let ((.cse1 (store .cse11 .cse8 v_ArrVal_1164))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1157) .cse9 v_ArrVal_1159) .cse10 v_ArrVal_1162)) (.cse2 (select (select .cse1 c_create_data_~data~0.base) .cse3))) (let ((.cse0 (store (store .cse6 .cse8 v_ArrVal_1163) .cse2 v_ArrVal_1165)) (.cse4 (* v_create_data_~counter~0_81 4))) (let ((.cse5 (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) 8 .cse4))) (or (< 0 (+ (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1166) c_create_data_~data~0.base) .cse3) v_ArrVal_1167) c_create_data_~data~0.base) .cse3) .cse4 13)) (not (= v_ArrVal_1167 (store v_ArrVal_1165 .cse5 (select v_ArrVal_1167 .cse5)))) (< .cse5 0) (< (+ (select (select .cse6 c_create_data_~data~0.base) .cse3) .cse4) 0) (< .cse7 v_create_data_~counter~0_81))))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1158))) (let ((.cse23 (select (select .cse27 c_create_data_~data~0.base) .cse3))) (let ((.cse26 (store .cse27 .cse23 v_ArrVal_1160))) (let ((.cse24 (select (select .cse26 c_create_data_~data~0.base) .cse3))) (let ((.cse25 (store .cse26 .cse24 v_ArrVal_1161))) (let ((.cse20 (select (select .cse25 c_create_data_~data~0.base) .cse3))) (let ((.cse22 (store .cse25 .cse20 v_ArrVal_1164))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1157) .cse23 v_ArrVal_1159) .cse24 v_ArrVal_1162)) (.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse3))) (let ((.cse19 (store .cse22 .cse21 v_ArrVal_1166)) (.cse14 (store (store .cse17 .cse20 v_ArrVal_1163) .cse21 v_ArrVal_1165)) (.cse18 (* v_create_data_~counter~0_81 4))) (let ((.cse16 (+ (select (select .cse14 c_create_data_~data~0.base) .cse3) 8 .cse18)) (.cse15 (select (select .cse19 c_create_data_~data~0.base) .cse3))) (or (not (= (store (select .cse14 .cse15) .cse16 (select v_ArrVal_1167 .cse16)) v_ArrVal_1167)) (< .cse16 0) (< (+ (select (select .cse17 c_create_data_~data~0.base) .cse3) .cse18) 0) (< (+ (select (select (store .cse14 .cse15 v_ArrVal_1167) c_create_data_~data~0.base) .cse3) 15 .cse18) (select |c_#length| (select (select (store .cse19 .cse15 v_ArrVal_1168) c_create_data_~data~0.base) .cse3))) (< .cse7 v_create_data_~counter~0_81))))))))))))))) is different from false [2024-11-07 16:30:39,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 3)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1158))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_1160))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse11 v_ArrVal_1161))) (let ((.cse8 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse12 .cse8 v_ArrVal_1164))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1157) .cse10 v_ArrVal_1159) .cse11 v_ArrVal_1162)) (.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store .cse6 .cse8 v_ArrVal_1163) .cse3 v_ArrVal_1165)) (.cse5 (* v_create_data_~counter~0_81 4))) (let ((.cse0 (+ (select (select .cse1 c_create_data_~data~0.base) .cse4) 8 .cse5))) (or (not (= (store v_ArrVal_1165 .cse0 (select v_ArrVal_1167 .cse0)) v_ArrVal_1167)) (< 0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_1166) c_create_data_~data~0.base) .cse4) v_ArrVal_1167) c_create_data_~data~0.base) .cse4) .cse5 13)) (< (+ (select (select .cse6 c_create_data_~data~0.base) .cse4) .cse5) 0) (< .cse0 0) (< .cse7 v_create_data_~counter~0_81))))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1158))) (let ((.cse24 (select (select .cse28 c_create_data_~data~0.base) .cse4))) (let ((.cse27 (store .cse28 .cse24 v_ArrVal_1160))) (let ((.cse25 (select (select .cse27 c_create_data_~data~0.base) .cse4))) (let ((.cse26 (store .cse27 .cse25 v_ArrVal_1161))) (let ((.cse23 (select (select .cse26 c_create_data_~data~0.base) .cse4))) (let ((.cse21 (store .cse26 .cse23 v_ArrVal_1164))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1157) .cse24 v_ArrVal_1159) .cse25 v_ArrVal_1162)) (.cse22 (select (select .cse21 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store (store .cse20 .cse23 v_ArrVal_1163) .cse22 v_ArrVal_1165)) (.cse18 (* v_create_data_~counter~0_81 4)) (.cse19 (store .cse21 .cse22 v_ArrVal_1166))) (let ((.cse16 (select (select .cse19 c_create_data_~data~0.base) .cse4)) (.cse17 (+ (select (select .cse15 c_create_data_~data~0.base) .cse4) 8 .cse18))) (or (not (= v_ArrVal_1167 (store (select .cse15 .cse16) .cse17 (select v_ArrVal_1167 .cse17)))) (< (+ (select (select (store .cse15 .cse16 v_ArrVal_1167) c_create_data_~data~0.base) .cse4) 15 .cse18) (select |c_#length| (select (select (store .cse19 .cse16 v_ArrVal_1168) c_create_data_~data~0.base) .cse4))) (< (+ (select (select .cse20 c_create_data_~data~0.base) .cse4) .cse18) 0) (< .cse17 0) (< .cse7 v_create_data_~counter~0_81)))))))))))))))) is different from false [2024-11-07 16:30:41,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (+ 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_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1158))) (let ((.cse12 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse16 .cse12 v_ArrVal_1160))) (let ((.cse13 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_1161))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (store .cse14 .cse10 v_ArrVal_1164))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1157) .cse12 v_ArrVal_1159) .cse13 v_ArrVal_1162)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store .cse7 .cse10 v_ArrVal_1163) .cse9 v_ArrVal_1165)) (.cse5 (* v_create_data_~counter~0_81 4)) (.cse6 (store .cse8 .cse9 v_ArrVal_1166))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4)) (.cse3 (+ (select (select .cse1 c_create_data_~data~0.base) .cse4) 8 .cse5))) (or (< .cse0 v_create_data_~counter~0_81) (not (= v_ArrVal_1167 (store (select .cse1 .cse2) .cse3 (select v_ArrVal_1167 .cse3)))) (< (+ (select (select (store .cse1 .cse2 v_ArrVal_1167) c_create_data_~data~0.base) .cse4) 15 .cse5) (select |c_#length| (select (select (store .cse6 .cse2 v_ArrVal_1168) c_create_data_~data~0.base) .cse4))) (< (+ (select (select .cse7 c_create_data_~data~0.base) .cse4) .cse5) 0) (< .cse3 0))))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1158))) (let ((.cse24 (select (select .cse28 c_create_data_~data~0.base) .cse4))) (let ((.cse27 (store .cse28 .cse24 v_ArrVal_1160))) (let ((.cse25 (select (select .cse27 c_create_data_~data~0.base) .cse4))) (let ((.cse26 (store .cse27 .cse25 v_ArrVal_1161))) (let ((.cse23 (select (select .cse26 c_create_data_~data~0.base) .cse4))) (let ((.cse19 (store .cse26 .cse23 v_ArrVal_1164))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1157) .cse24 v_ArrVal_1159) .cse25 v_ArrVal_1162)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store (store .cse22 .cse23 v_ArrVal_1163) .cse20 v_ArrVal_1165)) (.cse21 (* v_create_data_~counter~0_81 4))) (let ((.cse17 (+ (select (select .cse18 c_create_data_~data~0.base) .cse4) 8 .cse21))) (or (not (= (store v_ArrVal_1165 .cse17 (select v_ArrVal_1167 .cse17)) v_ArrVal_1167)) (< .cse0 v_create_data_~counter~0_81) (< 0 (+ (select (select (store .cse18 (select (select (store .cse19 .cse20 v_ArrVal_1166) c_create_data_~data~0.base) .cse4) v_ArrVal_1167) c_create_data_~data~0.base) .cse4) .cse21 13)) (< (+ (select (select .cse22 c_create_data_~data~0.base) .cse4) .cse21) 0) (< .cse17 0)))))))))))))))) is different from false [2024-11-07 16:30:42,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1156))) (let ((.cse11 (select (select .cse17 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store .cse17 .cse11 v_ArrVal_1158))) (let ((.cse12 (select (select .cse16 c_create_data_~data~0.base) .cse2))) (let ((.cse15 (store .cse16 .cse12 v_ArrVal_1160))) (let ((.cse13 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_1161))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse8 (store .cse14 .cse10 v_ArrVal_1164))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1155) .cse11 v_ArrVal_1157) .cse12 v_ArrVal_1159) .cse13 v_ArrVal_1162)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (let ((.cse0 (store (store .cse7 .cse10 v_ArrVal_1163) .cse9 v_ArrVal_1165)) (.cse3 (* v_create_data_~counter~0_81 4)) (.cse4 (store .cse8 .cse9 v_ArrVal_1166))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2)) (.cse6 (+ (select (select .cse0 c_create_data_~data~0.base) .cse2) 8 .cse3))) (or (< (+ (select (select (store .cse0 .cse1 v_ArrVal_1167) c_create_data_~data~0.base) .cse2) 15 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1168) c_create_data_~data~0.base) .cse2))) (< .cse5 v_create_data_~counter~0_81) (not (= (store (select .cse0 .cse1) .cse6 (select v_ArrVal_1167 .cse6)) v_ArrVal_1167)) (< .cse6 0) (< (+ (select (select .cse7 c_create_data_~data~0.base) .cse2) .cse3) 0))))))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1156))) (let ((.cse25 (select (select .cse31 c_create_data_~data~0.base) .cse2))) (let ((.cse30 (store .cse31 .cse25 v_ArrVal_1158))) (let ((.cse26 (select (select .cse30 c_create_data_~data~0.base) .cse2))) (let ((.cse29 (store .cse30 .cse26 v_ArrVal_1160))) (let ((.cse27 (select (select .cse29 c_create_data_~data~0.base) .cse2))) (let ((.cse28 (store .cse29 .cse27 v_ArrVal_1161))) (let ((.cse24 (select (select .cse28 c_create_data_~data~0.base) .cse2))) (let ((.cse19 (store .cse28 .cse24 v_ArrVal_1164))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1155) .cse25 v_ArrVal_1157) .cse26 v_ArrVal_1159) .cse27 v_ArrVal_1162)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse2))) (let ((.cse18 (store (store .cse23 .cse24 v_ArrVal_1163) .cse20 v_ArrVal_1165)) (.cse21 (* v_create_data_~counter~0_81 4))) (let ((.cse22 (+ (select (select .cse18 c_create_data_~data~0.base) .cse2) 8 .cse21))) (or (< .cse5 v_create_data_~counter~0_81) (< 0 (+ (select (select (store .cse18 (select (select (store .cse19 .cse20 v_ArrVal_1166) c_create_data_~data~0.base) .cse2) v_ArrVal_1167) c_create_data_~data~0.base) .cse2) .cse21 13)) (not (= (store v_ArrVal_1165 .cse22 (select v_ArrVal_1167 .cse22)) v_ArrVal_1167)) (< .cse22 0) (< (+ (select (select .cse23 c_create_data_~data~0.base) .cse2) .cse21) 0))))))))))))))))) is different from false [2024-11-07 16:30:44,519 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (+ 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_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1156))) (let ((.cse12 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse17 (store .cse18 .cse12 v_ArrVal_1158))) (let ((.cse13 (select (select .cse17 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store .cse17 .cse13 v_ArrVal_1160))) (let ((.cse14 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse16 .cse14 v_ArrVal_1161))) (let ((.cse8 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse15 .cse8 v_ArrVal_1164))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1155) .cse12 v_ArrVal_1157) .cse13 v_ArrVal_1159) .cse14 v_ArrVal_1162)) (.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_1166)) (.cse2 (* v_create_data_~counter~0_81 4)) (.cse5 (store (store .cse3 .cse8 v_ArrVal_1163) .cse9 v_ArrVal_1165))) (let ((.cse1 (+ 8 .cse2 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (or (< .cse0 v_create_data_~counter~0_81) (< .cse1 0) (< (+ .cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4)) 0) (not (= (store (select .cse5 .cse6) .cse1 (select v_ArrVal_1167 .cse1)) v_ArrVal_1167)) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_1167) c_create_data_~data~0.base) .cse4) 15 .cse2) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1168) c_create_data_~data~0.base) .cse4))))))))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_1156))) (let ((.cse26 (select (select .cse32 c_create_data_~data~0.base) .cse4))) (let ((.cse31 (store .cse32 .cse26 v_ArrVal_1158))) (let ((.cse27 (select (select .cse31 c_create_data_~data~0.base) .cse4))) (let ((.cse30 (store .cse31 .cse27 v_ArrVal_1160))) (let ((.cse28 (select (select .cse30 c_create_data_~data~0.base) .cse4))) (let ((.cse29 (store .cse30 .cse28 v_ArrVal_1161))) (let ((.cse25 (select (select .cse29 c_create_data_~data~0.base) .cse4))) (let ((.cse23 (store .cse29 .cse25 v_ArrVal_1164))) (let ((.cse21 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_1155) .cse26 v_ArrVal_1157) .cse27 v_ArrVal_1159) .cse28 v_ArrVal_1162)) (.cse24 (select (select .cse23 c_create_data_~data~0.base) .cse4))) (let ((.cse20 (* v_create_data_~counter~0_81 4)) (.cse22 (store (store .cse21 .cse25 v_ArrVal_1163) .cse24 v_ArrVal_1165))) (let ((.cse19 (+ 8 .cse20 (select (select .cse22 c_create_data_~data~0.base) .cse4)))) (or (< .cse0 v_create_data_~counter~0_81) (not (= v_ArrVal_1167 (store v_ArrVal_1165 .cse19 (select v_ArrVal_1167 .cse19)))) (< .cse19 0) (< (+ .cse20 (select (select .cse21 c_create_data_~data~0.base) .cse4)) 0) (< 0 (+ (select (select (store .cse22 (select (select (store .cse23 .cse24 v_ArrVal_1166) c_create_data_~data~0.base) .cse4) v_ArrVal_1167) c_create_data_~data~0.base) .cse4) .cse20 13))))))))))))))))))) is different from false [2024-11-07 16:30:48,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 5)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1156))) (let ((.cse10 (select (select .cse16 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (store .cse16 .cse10 v_ArrVal_1158))) (let ((.cse11 (select (select .cse15 c_create_data_~data~0.base) .cse3))) (let ((.cse14 (store .cse15 .cse11 v_ArrVal_1160))) (let ((.cse12 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse13 (store .cse14 .cse12 v_ArrVal_1161))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse13 .cse8 v_ArrVal_1164))) (let ((.cse2 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1155) .cse10 v_ArrVal_1157) .cse11 v_ArrVal_1159) .cse12 v_ArrVal_1162)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse1 (* v_create_data_~counter~0_81 4)) (.cse4 (store (store .cse2 .cse8 v_ArrVal_1163) .cse6 v_ArrVal_1165))) (let ((.cse0 (+ 8 .cse1 (select (select .cse4 c_create_data_~data~0.base) .cse3)))) (or (not (= v_ArrVal_1167 (store v_ArrVal_1165 .cse0 (select v_ArrVal_1167 .cse0)))) (< .cse0 0) (< (+ .cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3)) 0) (< 0 (+ (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_1166) c_create_data_~data~0.base) .cse3) v_ArrVal_1167) c_create_data_~data~0.base) .cse3) .cse1 13)) (< .cse7 v_create_data_~counter~0_81))))))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1156))) (let ((.cse26 (select (select .cse32 c_create_data_~data~0.base) .cse3))) (let ((.cse31 (store .cse32 .cse26 v_ArrVal_1158))) (let ((.cse27 (select (select .cse31 c_create_data_~data~0.base) .cse3))) (let ((.cse30 (store .cse31 .cse27 v_ArrVal_1160))) (let ((.cse28 (select (select .cse30 c_create_data_~data~0.base) .cse3))) (let ((.cse29 (store .cse30 .cse28 v_ArrVal_1161))) (let ((.cse23 (select (select .cse29 c_create_data_~data~0.base) .cse3))) (let ((.cse25 (store .cse29 .cse23 v_ArrVal_1164))) (let ((.cse19 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1155) .cse26 v_ArrVal_1157) .cse27 v_ArrVal_1159) .cse28 v_ArrVal_1162)) (.cse24 (select (select .cse25 c_create_data_~data~0.base) .cse3))) (let ((.cse22 (store .cse25 .cse24 v_ArrVal_1166)) (.cse18 (* v_create_data_~counter~0_81 4)) (.cse20 (store (store .cse19 .cse23 v_ArrVal_1163) .cse24 v_ArrVal_1165))) (let ((.cse17 (+ 8 .cse18 (select (select .cse20 c_create_data_~data~0.base) .cse3))) (.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse3))) (or (< .cse17 0) (< (+ .cse18 (select (select .cse19 c_create_data_~data~0.base) .cse3)) 0) (< .cse7 v_create_data_~counter~0_81) (not (= (store (select .cse20 .cse21) .cse17 (select v_ArrVal_1167 .cse17)) v_ArrVal_1167)) (< (+ (select (select (store .cse20 .cse21 v_ArrVal_1167) c_create_data_~data~0.base) .cse3) 15 .cse18) (select |c_#length| (select (select (store .cse22 .cse21 v_ArrVal_1168) c_create_data_~data~0.base) .cse3)))))))))))))))))))) is different from false [2024-11-07 16:30:59,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~counter~0 5)) (.cse5 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1154))) (let ((.cse9 (select (select .cse17 c_create_data_~data~0.base) .cse5))) (let ((.cse16 (store .cse17 .cse9 v_ArrVal_1156))) (let ((.cse10 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse10 v_ArrVal_1158))) (let ((.cse11 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse11 v_ArrVal_1160))) (let ((.cse12 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse12 v_ArrVal_1161))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (let ((.cse3 (store .cse13 .cse8 v_ArrVal_1164))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1153) .cse9 v_ArrVal_1155) .cse10 v_ArrVal_1157) .cse11 v_ArrVal_1159) .cse12 v_ArrVal_1162)) (.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse5))) (let ((.cse2 (store (store .cse7 .cse8 v_ArrVal_1163) .cse4 v_ArrVal_1165)) (.cse1 (* v_create_data_~counter~0_81 4))) (let ((.cse0 (+ (select (select .cse2 c_create_data_~data~0.base) .cse5) 8 .cse1))) (or (not (= v_ArrVal_1167 (store v_ArrVal_1165 .cse0 (select v_ArrVal_1167 .cse0)))) (< .cse0 0) (< 0 (+ .cse1 13 (select (select (store .cse2 (select (select (store .cse3 .cse4 v_ArrVal_1166) c_create_data_~data~0.base) .cse5) v_ArrVal_1167) c_create_data_~data~0.base) .cse5))) (< .cse6 v_create_data_~counter~0_81) (< (+ (select (select .cse7 c_create_data_~data~0.base) .cse5) .cse1) 0))))))))))))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_create_data_~counter~0_81 Int) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_1154))) (let ((.cse27 (select (select .cse35 c_create_data_~data~0.base) .cse5))) (let ((.cse34 (store .cse35 .cse27 v_ArrVal_1156))) (let ((.cse28 (select (select .cse34 c_create_data_~data~0.base) .cse5))) (let ((.cse33 (store .cse34 .cse28 v_ArrVal_1158))) (let ((.cse29 (select (select .cse33 c_create_data_~data~0.base) .cse5))) (let ((.cse32 (store .cse33 .cse29 v_ArrVal_1160))) (let ((.cse30 (select (select .cse32 c_create_data_~data~0.base) .cse5))) (let ((.cse31 (store .cse32 .cse30 v_ArrVal_1161))) (let ((.cse26 (select (select .cse31 c_create_data_~data~0.base) .cse5))) (let ((.cse24 (store .cse31 .cse26 v_ArrVal_1164))) (let ((.cse23 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_1153) .cse27 v_ArrVal_1155) .cse28 v_ArrVal_1157) .cse29 v_ArrVal_1159) .cse30 v_ArrVal_1162)) (.cse25 (select (select .cse24 c_create_data_~data~0.base) .cse5))) (let ((.cse19 (store (store .cse23 .cse26 v_ArrVal_1163) .cse25 v_ArrVal_1165)) (.cse18 (* v_create_data_~counter~0_81 4)) (.cse21 (store .cse24 .cse25 v_ArrVal_1166))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse5)) (.cse22 (+ (select (select .cse19 c_create_data_~data~0.base) .cse5) 8 .cse18))) (or (< (+ 15 .cse18 (select (select (store .cse19 .cse20 v_ArrVal_1167) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse21 .cse20 v_ArrVal_1168) c_create_data_~data~0.base) .cse5))) (< .cse22 0) (< .cse6 v_create_data_~counter~0_81) (not (= v_ArrVal_1167 (store (select .cse19 .cse20) .cse22 (select v_ArrVal_1167 .cse22)))) (< (+ (select (select .cse23 c_create_data_~data~0.base) .cse5) .cse18) 0))))))))))))))))))) is different from false