./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX --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.2.5-dev-a016563 [2024-11-08 17:14:16,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:14:16,120 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:14:16,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:14:16,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:14:16,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:14:16,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:14:16,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:14:16,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:14:16,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:14:16,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:14:16,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:14:16,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:14:16,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:14:16,157 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:14:16,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:14:16,158 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:14:16,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:14:16,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:14:16,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:14:16,160 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:14:16,160 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:14:16,161 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:14:16,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:14:16,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:14:16,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:14:16,163 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:14:16,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:14:16,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:14:16,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:14:16,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:14:16,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:14:16,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:14:16,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:14:16,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:14:16,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:14:16,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:14:16,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:14:16,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:14:16,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:14:16,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:14:16,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:14:16,172 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX 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-08 17:14:16,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:14:16,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:14:16,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:14:16,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:14:16,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:14:16,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i Unable to find full path for "g++" [2024-11-08 17:14:18,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:14:19,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:14:19,061 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-08 17:14:19,080 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/data/017a5d734/78e271c1633641d38bc687ec34e3372d/FLAGbf29ce09b [2024-11-08 17:14:19,373 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/data/017a5d734/78e271c1633641d38bc687ec34e3372d [2024-11-08 17:14:19,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:14:19,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:14:19,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:14:19,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:14:19,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:14:19,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:14:19" (1/1) ... [2024-11-08 17:14:19,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e1cb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:19, skipping insertion in model container [2024-11-08 17:14:19,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:14:19" (1/1) ... [2024-11-08 17:14:19,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:14:19,887 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:14:19,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:14:19,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:14:20,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:14:20,069 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:14:20,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20 WrapperNode [2024-11-08 17:14:20,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:14:20,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:14:20,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:14:20,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:14:20,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,125 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-08 17:14:20,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:14:20,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:14:20,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:14:20,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:14:20,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,176 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-08 17:14:20,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:14:20,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:14:20,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:14:20,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:14:20,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (1/1) ... [2024-11-08 17:14:20,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:14:20,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:14:20,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:14:20,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:14:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:14:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:14:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:14:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:14:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:14:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:14:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:14:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-08 17:14:20,305 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-08 17:14:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:14:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 17:14:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:14:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:14:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 17:14:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:14:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:14:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 17:14:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:14:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 17:14:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 17:14:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 17:14:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:14:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:14:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:14:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:14:20,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:14:20,467 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:14:20,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:14:21,226 INFO L? ?]: Removed 204 outVars from TransFormulas that were not future-live. [2024-11-08 17:14:21,227 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:14:21,261 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:14:21,261 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 17:14:21,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:14:21 BoogieIcfgContainer [2024-11-08 17:14:21,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:14:21,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:14:21,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:14:21,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:14:21,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:14:19" (1/3) ... [2024-11-08 17:14:21,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff2f965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:14:21, skipping insertion in model container [2024-11-08 17:14:21,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:14:20" (2/3) ... [2024-11-08 17:14:21,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff2f965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:14:21, skipping insertion in model container [2024-11-08 17:14:21,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:14:21" (3/3) ... [2024-11-08 17:14:21,278 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-08 17:14:21,306 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:14:21,307 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-08 17:14:21,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:14:21,384 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;@38db0bd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:14:21,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-08 17:14:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 98 states have (on average 2.1020408163265305) internal successors, (206), 190 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:14:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:14:21,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:21,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:14:21,397 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-08 17:14:21,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash 4899144, now seen corresponding path program 1 times [2024-11-08 17:14:21,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:21,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071198092] [2024-11-08 17:14:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:21,632 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-08 17:14:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:21,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071198092] [2024-11-08 17:14:21,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071198092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:21,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:21,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:14:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618694892] [2024-11-08 17:14:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:21,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:14:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:21,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:14:21,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:14:21,698 INFO L87 Difference]: Start difference. First operand has 194 states, 98 states have (on average 2.1020408163265305) internal successors, (206), 190 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 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-08 17:14:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:21,750 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2024-11-08 17:14:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:14:21,753 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-08 17:14:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:21,766 INFO L225 Difference]: With dead ends: 194 [2024-11-08 17:14:21,766 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 17:14:21,769 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-08 17:14:21,774 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-08 17:14:21,776 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-08 17:14:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 17:14:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-08 17:14:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 97 states have (on average 2.0721649484536084) internal successors, (201), 188 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-08 17:14:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2024-11-08 17:14:21,855 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 4 [2024-11-08 17:14:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2024-11-08 17:14:21,856 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-08 17:14:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2024-11-08 17:14:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:14:21,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:21,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:14:21,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:14:21,858 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-08 17:14:21,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 4896773, now seen corresponding path program 1 times [2024-11-08 17:14:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340453625] [2024-11-08 17:14:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:22,200 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-08 17:14:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:22,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340453625] [2024-11-08 17:14:22,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340453625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:22,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:14:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298946180] [2024-11-08 17:14:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:14:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:22,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:14:22,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:14:22,205 INFO L87 Difference]: Start difference. First operand 192 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-08 17:14:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:22,615 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2024-11-08 17:14:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:14:22,619 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-08 17:14:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:22,620 INFO L225 Difference]: With dead ends: 186 [2024-11-08 17:14:22,620 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 17:14:22,621 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-08 17:14:22,622 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 76 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 318 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:22,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 318 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:14:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 17:14:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-08 17:14:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 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-08 17:14:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2024-11-08 17:14:22,645 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2024-11-08 17:14:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:22,645 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2024-11-08 17:14:22,648 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-08 17:14:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2024-11-08 17:14:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:14:22,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:22,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:14:22,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:14:22,650 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-08 17:14:22,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:22,650 INFO L85 PathProgramCache]: Analyzing trace with hash 4896774, now seen corresponding path program 1 times [2024-11-08 17:14:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454861328] [2024-11-08 17:14:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:22,942 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-08 17:14:22,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:22,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454861328] [2024-11-08 17:14:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454861328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:22,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:22,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:14:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943980375] [2024-11-08 17:14:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:22,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:14:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:14:22,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:14:22,949 INFO L87 Difference]: Start difference. First operand 186 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-08 17:14:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:23,384 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2024-11-08 17:14:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:14:23,384 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-08 17:14:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:23,388 INFO L225 Difference]: With dead ends: 202 [2024-11-08 17:14:23,388 INFO L226 Difference]: Without dead ends: 202 [2024-11-08 17:14:23,389 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-08 17:14:23,390 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:23,393 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.4s Time] [2024-11-08 17:14:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-08 17:14:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2024-11-08 17:14:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 102 states have (on average 1.9803921568627452) internal successors, (202), 187 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-08 17:14:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2024-11-08 17:14:23,420 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 4 [2024-11-08 17:14:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:23,420 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2024-11-08 17:14:23,421 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-08 17:14:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2024-11-08 17:14:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 17:14:23,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:23,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 17:14:23,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:14:23,422 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-08 17:14:23,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash 151800072, now seen corresponding path program 1 times [2024-11-08 17:14:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215011064] [2024-11-08 17:14:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:23,487 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-08 17:14:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215011064] [2024-11-08 17:14:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215011064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:14:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981713163] [2024-11-08 17:14:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:14:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:14:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:23,490 INFO L87 Difference]: Start difference. First operand 191 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-08 17:14:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:23,675 INFO L93 Difference]: Finished difference Result 189 states and 203 transitions. [2024-11-08 17:14:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:14:23,676 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-08 17:14:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:23,677 INFO L225 Difference]: With dead ends: 189 [2024-11-08 17:14:23,677 INFO L226 Difference]: Without dead ends: 189 [2024-11-08 17:14:23,677 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-08 17:14:23,681 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:23,682 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.2s Time] [2024-11-08 17:14:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-08 17:14:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-08 17:14:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 102 states have (on average 1.9509803921568627) internal successors, (199), 185 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-08 17:14:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2024-11-08 17:14:23,703 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 5 [2024-11-08 17:14:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:23,708 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2024-11-08 17:14:23,708 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-08 17:14:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2024-11-08 17:14:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 17:14:23,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:23,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 17:14:23,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:14:23,709 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-08 17:14:23,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash 151800073, now seen corresponding path program 1 times [2024-11-08 17:14:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:23,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354251674] [2024-11-08 17:14:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:23,810 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-08 17:14:23,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:23,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354251674] [2024-11-08 17:14:23,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354251674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:23,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:23,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:14:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967212331] [2024-11-08 17:14:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:23,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:14:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:14:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:23,813 INFO L87 Difference]: Start difference. First operand 189 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-08 17:14:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:24,003 INFO L93 Difference]: Finished difference Result 187 states and 200 transitions. [2024-11-08 17:14:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:14:24,004 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-08 17:14:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:24,005 INFO L225 Difference]: With dead ends: 187 [2024-11-08 17:14:24,006 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 17:14:24,006 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-08 17:14:24,009 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:24,013 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.2s Time] [2024-11-08 17:14:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 17:14:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-08 17:14:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 102 states have (on average 1.9215686274509804) internal successors, (196), 183 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-08 17:14:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2024-11-08 17:14:24,047 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 5 [2024-11-08 17:14:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:24,048 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2024-11-08 17:14:24,048 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-08 17:14:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2024-11-08 17:14:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 17:14:24,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:24,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:24,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:14:24,049 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-08 17:14:24,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1681893207, now seen corresponding path program 1 times [2024-11-08 17:14:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:24,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116175878] [2024-11-08 17:14:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:24,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:24,262 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-08 17:14:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116175878] [2024-11-08 17:14:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116175878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:24,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:14:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738313591] [2024-11-08 17:14:24,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:24,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:14:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:14:24,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:14:24,270 INFO L87 Difference]: Start difference. First operand 187 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-08 17:14:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:24,424 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2024-11-08 17:14:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:14:24,425 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-08 17:14:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:24,426 INFO L225 Difference]: With dead ends: 196 [2024-11-08 17:14:24,427 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 17:14:24,427 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-08 17:14:24,428 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:24,428 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-08 17:14:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 17:14:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2024-11-08 17:14:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.912621359223301) internal successors, (197), 184 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-08 17:14:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2024-11-08 17:14:24,444 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 10 [2024-11-08 17:14:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:24,445 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2024-11-08 17:14:24,445 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-08 17:14:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2024-11-08 17:14:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 17:14:24,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:24,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:14:24,448 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-08 17:14:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1388535869, now seen corresponding path program 1 times [2024-11-08 17:14:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:24,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314796986] [2024-11-08 17:14:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:24,583 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-08 17:14:24,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314796986] [2024-11-08 17:14:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314796986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:24,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:24,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:14:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550899772] [2024-11-08 17:14:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:24,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:14:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:14:24,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:14:24,586 INFO L87 Difference]: Start difference. First operand 188 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-08 17:14:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:24,638 INFO L93 Difference]: Finished difference Result 268 states and 286 transitions. [2024-11-08 17:14:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:14:24,639 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-08 17:14:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:24,641 INFO L225 Difference]: With dead ends: 268 [2024-11-08 17:14:24,641 INFO L226 Difference]: Without dead ends: 268 [2024-11-08 17:14:24,642 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-08 17:14:24,643 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 85 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 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-08 17:14:24,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 569 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:14:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-08 17:14:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2024-11-08 17:14:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 146 states have (on average 1.9315068493150684) internal successors, (282), 227 states have internal predecessors, (282), 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-08 17:14:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 286 transitions. [2024-11-08 17:14:24,657 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 286 transitions. Word has length 12 [2024-11-08 17:14:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:24,658 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 286 transitions. [2024-11-08 17:14:24,658 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-08 17:14:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 286 transitions. [2024-11-08 17:14:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:14:24,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:24,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:14:24,660 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-08 17:14:24,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 94945168, now seen corresponding path program 1 times [2024-11-08 17:14:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689777470] [2024-11-08 17:14:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:24,767 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-08 17:14:24,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689777470] [2024-11-08 17:14:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689777470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:24,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:14:24,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172384106] [2024-11-08 17:14:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:14:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:14:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:24,770 INFO L87 Difference]: Start difference. First operand 232 states and 286 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-08 17:14:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:24,961 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2024-11-08 17:14:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:14:24,962 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-08 17:14:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:24,963 INFO L225 Difference]: With dead ends: 217 [2024-11-08 17:14:24,963 INFO L226 Difference]: Without dead ends: 217 [2024-11-08 17:14:24,963 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-08 17:14:24,964 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 207 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:24,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 207 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:14:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-08 17:14:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-08 17:14:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 146 states have (on average 1.726027397260274) internal successors, (252), 212 states have internal predecessors, (252), 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-08 17:14:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2024-11-08 17:14:24,974 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 13 [2024-11-08 17:14:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:24,975 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2024-11-08 17:14:24,975 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-08 17:14:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2024-11-08 17:14:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:14:24,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:24,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:24,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:14:24,977 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-08 17:14:24,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash 94945169, now seen corresponding path program 1 times [2024-11-08 17:14:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958619481] [2024-11-08 17:14:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:25,162 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-08 17:14:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:25,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958619481] [2024-11-08 17:14:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958619481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:14:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503448169] [2024-11-08 17:14:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:25,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:14:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:14:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:25,170 INFO L87 Difference]: Start difference. First operand 217 states and 256 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-08 17:14:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:25,340 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2024-11-08 17:14:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:14:25,340 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-08 17:14:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:25,342 INFO L225 Difference]: With dead ends: 202 [2024-11-08 17:14:25,342 INFO L226 Difference]: Without dead ends: 202 [2024-11-08 17:14:25,342 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-08 17:14:25,343 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 209 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:25,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 209 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:14:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-08 17:14:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-08 17:14:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 146 states have (on average 1.5205479452054795) internal successors, (222), 197 states have internal predecessors, (222), 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-08 17:14:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2024-11-08 17:14:25,352 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 13 [2024-11-08 17:14:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:25,352 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2024-11-08 17:14:25,352 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-08 17:14:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2024-11-08 17:14:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 17:14:25,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:25,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:25,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:14:25,354 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-08 17:14:25,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1585435370, now seen corresponding path program 1 times [2024-11-08 17:14:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146581472] [2024-11-08 17:14:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:25,534 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-08 17:14:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:25,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146581472] [2024-11-08 17:14:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146581472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:14:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195461089] [2024-11-08 17:14:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:25,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:14:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:25,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:14:25,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:14:25,536 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:14:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:25,835 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2024-11-08 17:14:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:14:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-08 17:14:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:25,837 INFO L225 Difference]: With dead ends: 257 [2024-11-08 17:14:25,837 INFO L226 Difference]: Without dead ends: 257 [2024-11-08 17:14:25,838 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-08 17:14:25,839 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 25 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:25,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 421 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:14:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-08 17:14:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 212. [2024-11-08 17:14:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 156 states have (on average 1.5256410256410255) internal successors, (238), 207 states have internal predecessors, (238), 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-08 17:14:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2024-11-08 17:14:25,852 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 19 [2024-11-08 17:14:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2024-11-08 17:14:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:14:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2024-11-08 17:14:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 17:14:25,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:25,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:25,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:14:25,854 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-08 17:14:25,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1585435369, now seen corresponding path program 1 times [2024-11-08 17:14:25,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:25,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732329601] [2024-11-08 17:14:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:26,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-08 17:14:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:26,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732329601] [2024-11-08 17:14:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732329601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:26,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:14:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975560914] [2024-11-08 17:14:26,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:26,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:14:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:26,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:14:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:14:26,206 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:14:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:26,611 INFO L93 Difference]: Finished difference Result 212 states and 236 transitions. [2024-11-08 17:14:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:14:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-08 17:14:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:26,613 INFO L225 Difference]: With dead ends: 212 [2024-11-08 17:14:26,614 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 17:14:26,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:14:26,615 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 2 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:26,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 521 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:14:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 17:14:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-08 17:14:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 156 states have (on average 1.4871794871794872) internal successors, (232), 207 states have internal predecessors, (232), 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-08 17:14:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2024-11-08 17:14:26,626 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 19 [2024-11-08 17:14:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:26,626 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2024-11-08 17:14:26,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:14:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2024-11-08 17:14:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 17:14:26,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:26,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:26,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:14:26,628 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-08 17:14:26,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:26,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1797832533, now seen corresponding path program 1 times [2024-11-08 17:14:26,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:26,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001715086] [2024-11-08 17:14:26,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:26,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:26,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001715086] [2024-11-08 17:14:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001715086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:14:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400862589] [2024-11-08 17:14:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:26,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:26,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:14:26,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:14:26,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:14:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:27,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 17:14:27,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:27,257 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 17:14:27,258 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-08 17:14:27,322 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-08 17:14:27,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:27,506 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-08 17:14:27,564 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-08 17:14:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:14:27,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:14:27,725 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-08 17:14:27,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:27,767 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-08 17:14:27,773 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-08 17:14:27,789 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-08 17:14:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 17:14:27,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400862589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:14:27,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:14:27,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-08 17:14:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800806255] [2024-11-08 17:14:27,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:14:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:14:27,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:27,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:14:27,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=112, Unknown=7, NotChecked=22, Total=182 [2024-11-08 17:14:27,837 INFO L87 Difference]: Start difference. First operand 212 states and 236 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 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-08 17:14:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:28,593 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2024-11-08 17:14:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:14:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 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 25 [2024-11-08 17:14:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:28,596 INFO L225 Difference]: With dead ends: 213 [2024-11-08 17:14:28,596 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 17:14:28,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=112, Unknown=7, NotChecked=22, Total=182 [2024-11-08 17:14:28,597 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 23 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:28,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 979 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 646 Invalid, 0 Unknown, 93 Unchecked, 0.7s Time] [2024-11-08 17:14:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 17:14:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-08 17:14:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 156 states have (on average 1.4743589743589745) internal successors, (230), 206 states have internal predecessors, (230), 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-08 17:14:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 234 transitions. [2024-11-08 17:14:28,604 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 234 transitions. Word has length 25 [2024-11-08 17:14:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:28,604 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 234 transitions. [2024-11-08 17:14:28,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 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-08 17:14:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 234 transitions. [2024-11-08 17:14:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 17:14:28,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:28,606 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:28,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:14:28,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:28,810 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-08 17:14:28,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1797832532, now seen corresponding path program 1 times [2024-11-08 17:14:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033550461] [2024-11-08 17:14:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:29,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:29,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033550461] [2024-11-08 17:14:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033550461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:14:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871367197] [2024-11-08 17:14:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:29,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:29,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:14:29,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:14:29,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:14:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:29,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:14:29,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:29,655 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-08 17:14:29,663 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-08 17:14:29,669 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-08 17:14:29,694 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-08 17:14:29,715 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-08 17:14:29,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:29,896 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-08 17:14:29,904 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-08 17:14:30,013 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-08 17:14:30,026 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-08 17:14:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:30,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:14:30,449 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_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) 4)))))) is different from false [2024-11-08 17:14:30,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:30,463 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-08 17:14:30,468 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-08 17:14:30,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:30,489 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-08 17:14:30,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:30,499 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-08 17:14:30,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:14:30,507 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-08 17:14:30,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:14:30,516 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-08 17:14:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:30,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871367197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:14:30,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:14:30,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2024-11-08 17:14:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082645981] [2024-11-08 17:14:30,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:14:30,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:14:30,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:14:30,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=226, Unknown=19, NotChecked=32, Total=342 [2024-11-08 17:14:30,563 INFO L87 Difference]: Start difference. First operand 211 states and 234 transitions. Second operand has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 19 states have internal predecessors, (47), 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-08 17:14:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:31,743 INFO L93 Difference]: Finished difference Result 235 states and 262 transitions. [2024-11-08 17:14:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:14:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 19 states have internal predecessors, (47), 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 25 [2024-11-08 17:14:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:31,746 INFO L225 Difference]: With dead ends: 235 [2024-11-08 17:14:31,746 INFO L226 Difference]: Without dead ends: 235 [2024-11-08 17:14:31,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=310, Unknown=19, NotChecked=38, Total=462 [2024-11-08 17:14:31,749 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 6 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 2 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:31,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1125 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 789 Invalid, 16 Unknown, 90 Unchecked, 1.0s Time] [2024-11-08 17:14:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-08 17:14:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-08 17:14:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 180 states have (on average 1.4333333333333333) internal successors, (258), 230 states have internal predecessors, (258), 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-08 17:14:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 262 transitions. [2024-11-08 17:14:31,760 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 262 transitions. Word has length 25 [2024-11-08 17:14:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:31,760 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 262 transitions. [2024-11-08 17:14:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 19 states have internal predecessors, (47), 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-08 17:14:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 262 transitions. [2024-11-08 17:14:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 17:14:31,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:31,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:31,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:14:31,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:31,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-08 17:14:31,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash -949238191, now seen corresponding path program 1 times [2024-11-08 17:14:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:31,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876987323] [2024-11-08 17:14:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 17:14:32,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:32,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876987323] [2024-11-08 17:14:32,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876987323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:32,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:32,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:14:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534927664] [2024-11-08 17:14:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:32,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:14:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:32,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:14:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:32,085 INFO L87 Difference]: Start difference. First operand 235 states and 262 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-08 17:14:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:32,226 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2024-11-08 17:14:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:14:32,227 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 37 [2024-11-08 17:14:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:32,228 INFO L225 Difference]: With dead ends: 233 [2024-11-08 17:14:32,228 INFO L226 Difference]: Without dead ends: 233 [2024-11-08 17:14:32,229 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-08 17:14:32,229 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 6 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:32,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:14:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-08 17:14:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-08 17:14:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 180 states have (on average 1.4111111111111112) internal successors, (254), 228 states have internal predecessors, (254), 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-08 17:14:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2024-11-08 17:14:32,237 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 37 [2024-11-08 17:14:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:32,238 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2024-11-08 17:14:32,238 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-08 17:14:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2024-11-08 17:14:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 17:14:32,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:32,239 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:32,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:14:32,240 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-08 17:14:32,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash -949238190, now seen corresponding path program 1 times [2024-11-08 17:14:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129943384] [2024-11-08 17:14:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129943384] [2024-11-08 17:14:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129943384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:14:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400062910] [2024-11-08 17:14:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:14:32,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:14:32,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:14:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:32,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:14:32,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:32,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:14:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400062910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:14:32,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:14:32,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-08 17:14:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114142928] [2024-11-08 17:14:32,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:14:32,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:14:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:32,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:14:32,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:14:32,622 INFO L87 Difference]: Start difference. First operand 233 states and 258 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-08 17:14:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:32,682 INFO L93 Difference]: Finished difference Result 261 states and 284 transitions. [2024-11-08 17:14:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:14:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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 37 [2024-11-08 17:14:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:32,687 INFO L225 Difference]: With dead ends: 261 [2024-11-08 17:14:32,687 INFO L226 Difference]: Without dead ends: 261 [2024-11-08 17:14:32,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:14:32,688 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:32,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 318 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:14:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-08 17:14:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-08 17:14:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 256 states have internal predecessors, (280), 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-08 17:14:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 284 transitions. [2024-11-08 17:14:32,699 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 284 transitions. Word has length 37 [2024-11-08 17:14:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:32,699 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 284 transitions. [2024-11-08 17:14:32,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-08 17:14:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 284 transitions. [2024-11-08 17:14:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 17:14:32,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:32,701 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:32,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:14:32,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 17:14:32,902 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-08 17:14:32,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2146036886, now seen corresponding path program 2 times [2024-11-08 17:14:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917996883] [2024-11-08 17:14:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917996883] [2024-11-08 17:14:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917996883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:14:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146512301] [2024-11-08 17:14:33,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:14:33,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:33,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:14:33,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:14:33,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:14:34,023 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:14:34,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:14:34,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 17:14:34,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:34,053 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-08 17:14:34,063 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-08 17:14:34,070 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-08 17:14:34,112 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-08 17:14:34,123 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-08 17:14:34,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:34,334 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-08 17:14:34,341 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-08 17:14:34,522 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:34,522 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-08 17:14:34,529 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-08 17:14:34,719 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:34,719 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-08 17:14:34,729 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-08 17:14:34,835 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-08 17:14:34,844 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-08 17:14:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:34,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:14:35,177 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_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_427) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_428 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-11-08 17:14:35,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_428 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_427) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-08 17:14:35,247 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_425 (Array Int Int)) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_425))) (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_426) .cse0 v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_427) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_426) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_425) c_create_data_~data~0.base) .cse1) v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2024-11-08 17:14:35,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_425))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_426) .cse1 v_ArrVal_428) c_create_data_~data~0.base) .cse2) .cse3 12) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_427) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_426) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_425) c_create_data_~data~0.base) .cse2) v_ArrVal_428) c_create_data_~data~0.base) .cse2) .cse3 8)))))) is different from false [2024-11-08 17:14:35,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_424))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_423) .cse1 v_ArrVal_426) (select (select (store .cse2 .cse1 v_ArrVal_425) c_create_data_~data~0.base) .cse3) v_ArrVal_428))) c_create_data_~data~0.base) .cse3) 12))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_424))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_425))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_423) .cse4 v_ArrVal_426) .cse5 v_ArrVal_428) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_427) c_create_data_~data~0.base) .cse3)))))))))) is different from false [2024-11-08 17:14:35,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_424))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_423) .cse1 v_ArrVal_426) (select (select (store .cse2 .cse1 v_ArrVal_425) c_create_data_~data~0.base) .cse3) v_ArrVal_428))) c_create_data_~data~0.base) .cse3) 12))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_424))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_425))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_423) .cse4 v_ArrVal_426) .cse5 v_ArrVal_428) c_create_data_~data~0.base) .cse3) 16) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_427) c_create_data_~data~0.base) .cse3))))))))))) is different from false [2024-11-08 17:14:35,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:35,760 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 177 treesize of output 178 [2024-11-08 17:14:35,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:35,770 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 167 treesize of output 108 [2024-11-08 17:14:35,784 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 4252 treesize of output 3550 [2024-11-08 17:14:35,830 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 1272 treesize of output 1224 [2024-11-08 17:14:35,859 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 56 treesize of output 52 [2024-11-08 17:14:35,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-11-08 17:14:35,876 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 48 treesize of output 36 [2024-11-08 17:14:35,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-08 17:14:35,890 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 57 treesize of output 45 [2024-11-08 17:14:35,896 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 16 treesize of output 12 [2024-11-08 17:14:35,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:35,923 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 90 treesize of output 91 [2024-11-08 17:14:35,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:35,937 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 80 treesize of output 61 [2024-11-08 17:14:35,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:14:35,945 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 85 treesize of output 55 [2024-11-08 17:14:35,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:14:35,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:14:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2024-11-08 17:14:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146512301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:14:36,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:14:36,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2024-11-08 17:14:36,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268617495] [2024-11-08 17:14:36,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:14:36,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 17:14:36,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:36,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 17:14:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=691, Unknown=38, NotChecked=366, Total=1260 [2024-11-08 17:14:36,011 INFO L87 Difference]: Start difference. First operand 261 states and 284 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 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-08 17:14:37,837 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_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_428) c_create_data_~data~0.base) .cse3) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_427) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_428 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_428) c_create_data_~data~0.base) .cse3) .cse1 4))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_425))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_426) .cse4 v_ArrVal_428) c_create_data_~data~0.base) .cse3) .cse1 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_427) c_create_data_~data~0.base) .cse3)))))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_426) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_425) c_create_data_~data~0.base) .cse3) v_ArrVal_428) c_create_data_~data~0.base) .cse3) .cse1 8)))))) is different from false [2024-11-08 17:14:37,851 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_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_428) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_427) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_428 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_428) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_425))) (let ((.cse2 (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_426) .cse2 v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse0 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_427) c_create_data_~data~0.base) .cse1)))))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse0)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_426) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_425) c_create_data_~data~0.base) .cse1) v_ArrVal_428) c_create_data_~data~0.base) .cse1) .cse0 8))) (<= (+ |c_create_data_#t~mem8.offset| .cse0 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2024-11-08 17:14:38,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_428) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_427) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse2 .cse0)) (forall ((v_ArrVal_428 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_428) c_create_data_~data~0.base) .cse1) 4))) (<= (+ .cse2 .cse0 4) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse0)) (<= (+ |c_create_data_#t~mem8.offset| .cse0 4) (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2024-11-08 17:14:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:39,221 INFO L93 Difference]: Finished difference Result 293 states and 316 transitions. [2024-11-08 17:14:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 17:14:39,222 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 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 37 [2024-11-08 17:14:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:39,223 INFO L225 Difference]: With dead ends: 293 [2024-11-08 17:14:39,224 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 17:14:39,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=357, Invalid=1327, Unknown=74, NotChecked=792, Total=2550 [2024-11-08 17:14:39,226 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 33 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 8 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 855 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:39,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1642 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1003 Invalid, 28 Unknown, 855 Unchecked, 1.4s Time] [2024-11-08 17:14:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 17:14:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-08 17:14:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 240 states have (on average 1.3) internal successors, (312), 288 states have internal predecessors, (312), 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-08 17:14:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 316 transitions. [2024-11-08 17:14:39,235 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 316 transitions. Word has length 37 [2024-11-08 17:14:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:39,235 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 316 transitions. [2024-11-08 17:14:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 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-08 17:14:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 316 transitions. [2024-11-08 17:14:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 17:14:39,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:39,237 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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-08 17:14:39,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:14:39,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 17:14:39,442 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-08 17:14:39,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:39,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1656622810, now seen corresponding path program 2 times [2024-11-08 17:14:39,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:39,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709284286] [2024-11-08 17:14:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:39,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 17:14:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709284286] [2024-11-08 17:14:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709284286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:39,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:14:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696364853] [2024-11-08 17:14:39,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:39,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:14:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:39,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:14:39,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:39,644 INFO L87 Difference]: Start difference. First operand 293 states and 316 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-08 17:14:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:39,784 INFO L93 Difference]: Finished difference Result 291 states and 312 transitions. [2024-11-08 17:14:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:14:39,784 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 61 [2024-11-08 17:14:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:39,786 INFO L225 Difference]: With dead ends: 291 [2024-11-08 17:14:39,787 INFO L226 Difference]: Without dead ends: 291 [2024-11-08 17:14:39,787 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-08 17:14:39,788 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 6 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:39,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 242 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:14:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-08 17:14:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-08 17:14:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 240 states have (on average 1.2833333333333334) internal successors, (308), 286 states have internal predecessors, (308), 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-08 17:14:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 312 transitions. [2024-11-08 17:14:39,797 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 312 transitions. Word has length 61 [2024-11-08 17:14:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:39,798 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 312 transitions. [2024-11-08 17:14:39,799 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-08 17:14:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 312 transitions. [2024-11-08 17:14:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 17:14:39,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:39,802 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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-08 17:14:39,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:14:39,803 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-08 17:14:39,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash 11688509, now seen corresponding path program 1 times [2024-11-08 17:14:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223434856] [2024-11-08 17:14:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:39,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:14:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:40,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223434856] [2024-11-08 17:14:40,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223434856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:14:40,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863335125] [2024-11-08 17:14:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:40,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:14:40,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:14:40,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:14:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:40,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:14:40,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:40,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:14:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863335125] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:14:40,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:14:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2024-11-08 17:14:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916228026] [2024-11-08 17:14:40,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:14:40,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:14:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:14:40,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:14:40,802 INFO L87 Difference]: Start difference. First operand 291 states and 312 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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-08 17:14:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:41,109 INFO L93 Difference]: Finished difference Result 357 states and 384 transitions. [2024-11-08 17:14:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:14:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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 66 [2024-11-08 17:14:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:41,111 INFO L225 Difference]: With dead ends: 357 [2024-11-08 17:14:41,112 INFO L226 Difference]: Without dead ends: 357 [2024-11-08 17:14:41,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:14:41,113 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 23 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:41,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 808 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:14:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-08 17:14:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2024-11-08 17:14:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 304 states have (on average 1.243421052631579) internal successors, (378), 350 states have internal predecessors, (378), 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-08 17:14:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 382 transitions. [2024-11-08 17:14:41,123 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 382 transitions. Word has length 66 [2024-11-08 17:14:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:41,123 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 382 transitions. [2024-11-08 17:14:41,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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-08 17:14:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 382 transitions. [2024-11-08 17:14:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:14:41,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:41,126 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:41,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 17:14:41,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 17:14:41,327 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-08 17:14:41,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1990516927, now seen corresponding path program 3 times [2024-11-08 17:14:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:41,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793343010] [2024-11-08 17:14:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:41,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793343010] [2024-11-08 17:14:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793343010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:14:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774818982] [2024-11-08 17:14:44,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 17:14:44,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:14:44,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:14:44,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:14:44,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_149be18d-2fca-4805-a7f4-5bcc7e344f0e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:14:45,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-08 17:14:45,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:14:45,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 17:14:45,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:45,237 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-08 17:14:45,245 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-08 17:14:45,254 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-08 17:14:45,277 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-08 17:14:45,290 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-08 17:14:45,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:45,479 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-08 17:14:45,489 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-08 17:14:45,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:45,676 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-08 17:14:45,686 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-08 17:14:45,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:45,884 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-08 17:14:45,889 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-08 17:14:46,114 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:46,115 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-08 17:14:46,125 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-08 17:14:46,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:46,325 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-08 17:14:46,332 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-08 17:14:46,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:46,533 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-08 17:14:46,546 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-08 17:14:46,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:46,794 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-08 17:14:46,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:14:47,054 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:47,055 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-08 17:14:47,061 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-08 17:14:47,241 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-08 17:14:47,249 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-08 17:14:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:14:47,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:14:48,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_858))) (or (forall ((v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_859))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_861) c_create_data_~data~0.base) .cse2) .cse3 11) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_860) c_create_data_~data~0.base) .cse2)))))) (< (+ .cse3 (select (select .cse0 c_create_data_~data~0.base) .cse2) 4) 0)))) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_858))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (or (< c_create_data_~counter~0 (div (+ (- 1) (* (- 1) .cse6)) 4)) (forall ((v_ArrVal_861 (Array Int Int))) (< (+ (mod (+ 3 (* 3 .cse6)) 4) .cse6) (+ (select (select (store .cse7 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_859) c_create_data_~data~0.base) .cse2) v_ArrVal_861) c_create_data_~data~0.base) .cse2) 8)))))))))) is different from false [2024-11-08 17:14:48,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_858))) (or (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_859))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_861) c_create_data_~data~0.base) .cse2) .cse3 15) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_860) c_create_data_~data~0.base) .cse2))))) (< (+ .cse3 8 (select (select .cse0 c_create_data_~data~0.base) .cse2)) 0)))) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_858))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse6)) 4)) (< (+ (mod (+ 3 (* 3 .cse6)) 4) .cse6) (+ (select (select (store .cse7 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_859) c_create_data_~data~0.base) .cse2) v_ArrVal_861) c_create_data_~data~0.base) .cse2) 8))))))))) is different from false [2024-11-08 17:14:48,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_857) .cse3 v_ArrVal_858))) (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)) (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4) 8)))))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_856))) (let ((.cse10 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_857) .cse10 v_ArrVal_858)) (.cse7 (* c_create_data_~counter~0 4))) (or (let ((.cse8 (store .cse9 .cse10 v_ArrVal_859))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_861) c_create_data_~data~0.base) .cse4) .cse7 15) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))) (< (+ (select (select .cse5 c_create_data_~data~0.base) .cse4) .cse7 8) 0)))))))) is different from false [2024-11-08 17:14:48,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_857) .cse6 v_ArrVal_858)) (.cse2 (* c_create_data_~counter~0 4))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 8) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse0 .cse3 v_ArrVal_861) c_create_data_~data~0.base) .cse1) .cse2 15) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_860) c_create_data_~data~0.base) .cse1)))))))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_856))) (let ((.cse11 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_857) .cse11 v_ArrVal_858))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse1))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* .cse8 (- 1))) 4)) (< (+ .cse8 (mod (+ (* .cse8 3) 3) 4)) (+ (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_859) c_create_data_~data~0.base) .cse1) v_ArrVal_861) c_create_data_~data~0.base) .cse1) 8))))))))))) is different from false [2024-11-08 17:14:48,548 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_856 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* .cse0 (- 1))) 4)) (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4) 8)))))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_856))) (let ((.cse11 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_857) .cse11 v_ArrVal_858)) (.cse8 (* c_create_data_~counter~0 4))) (or (let ((.cse9 (store .cse10 .cse11 v_ArrVal_859))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (< (+ 19 (select (select (store .cse6 .cse7 v_ArrVal_861) c_create_data_~data~0.base) .cse4) .cse8) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))) (< (+ (select (select .cse6 c_create_data_~data~0.base) .cse4) .cse8 12) 0))))))))) is different from false [2024-11-08 17:14:48,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_855))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse6 .cse5 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 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_854) .cse5 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ (mod (+ 3 (* 3 .cse0)) 4) .cse0) (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4) 8)) (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_855))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_856))) (let ((.cse12 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse9 (* c_create_data_~counter~0 4)) (.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_854) .cse13 v_ArrVal_857) .cse12 v_ArrVal_858))) (or (let ((.cse10 (store .cse11 .cse12 v_ArrVal_859))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (< (+ 19 (select (select (store .cse7 .cse8 v_ArrVal_861) c_create_data_~data~0.base) .cse4) .cse9) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))) (< (+ .cse9 12 (select (select .cse7 c_create_data_~data~0.base) .cse4)) 0)))))))))) is different from false [2024-11-08 17:14:48,805 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_854 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_855))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_854) .cse8 v_ArrVal_857) .cse6 v_ArrVal_858)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 12) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ 19 (select (select (store .cse1 .cse3 v_ArrVal_861) c_create_data_~data~0.base) .cse2) .cse0) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_860) c_create_data_~data~0.base) .cse2)))))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_855))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_856))) (let ((.cse13 (select (select .cse12 c_create_data_~data~0.base) .cse2))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_854) .cse14 v_ArrVal_857) .cse13 v_ArrVal_858))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (or (< (+ (mod (+ 3 (* 3 .cse10)) 4) .cse10) (+ (select (select (store .cse11 (select (select (store .cse12 .cse13 v_ArrVal_859) c_create_data_~data~0.base) .cse2) v_ArrVal_861) c_create_data_~data~0.base) .cse2) 8)) (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse10)) 4))))))))))))) is different from false [2024-11-08 17:14:48,974 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_854 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_855))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_854) .cse8 v_ArrVal_857) .cse6 v_ArrVal_858)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ 16 .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ 23 (select (select (store .cse1 .cse3 v_ArrVal_861) c_create_data_~data~0.base) .cse2) .cse0) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_860) c_create_data_~data~0.base) .cse2)))))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_855))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_856))) (let ((.cse13 (select (select .cse12 c_create_data_~data~0.base) .cse2))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_854) .cse14 v_ArrVal_857) .cse13 v_ArrVal_858))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (or (< (+ (mod (+ 3 (* 3 .cse10)) 4) .cse10) (+ (select (select (store .cse11 (select (select (store .cse12 .cse13 v_ArrVal_859) c_create_data_~data~0.base) .cse2) v_ArrVal_861) c_create_data_~data~0.base) .cse2) 8)) (< (+ c_create_data_~counter~0 3) (div (+ (- 1) (* (- 1) .cse10)) 4))))))))))))) is different from false [2024-11-08 17:14:49,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_852))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_855))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse7 .cse6 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_853) .cse5 v_ArrVal_854) .cse6 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ .cse0 (mod (+ 3 (* .cse0 3)) 4)) (+ 8 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4))) (< (+ c_create_data_~counter~0 3) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_852))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_855))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_856))) (let ((.cse14 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (* c_create_data_~counter~0 4)) (.cse9 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_853) .cse15 v_ArrVal_854) .cse16 v_ArrVal_857) .cse14 v_ArrVal_858))) (or (< (+ (select (select .cse9 c_create_data_~data~0.base) .cse4) 16 .cse10) 0) (let ((.cse12 (store .cse13 .cse14 v_ArrVal_859))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (< (+ 23 .cse10 (select (select (store .cse9 .cse11 v_ArrVal_861) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_860) c_create_data_~data~0.base) .cse4)))))))))))))))) is different from false [2024-11-08 17:14:53,447 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_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_852))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_855))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse8 .cse7 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_853) .cse6 v_ArrVal_854) .cse7 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ (mod (+ (* .cse0 3) 3) 4) .cse0) (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4) 8)) (< (+ c_create_data_~counter~0 3) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_852))) (let ((.cse16 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_855))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse18 .cse17 v_ArrVal_856))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_853) .cse16 v_ArrVal_854) .cse17 v_ArrVal_857) .cse15 v_ArrVal_858)) (.cse11 (* c_create_data_~counter~0 4))) (or (< (+ (select (select .cse10 c_create_data_~data~0.base) .cse4) 16 .cse11) 0) (let ((.cse13 (store .cse14 .cse15 v_ArrVal_859))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (< (+ 23 (select (select (store .cse10 .cse12 v_ArrVal_861) c_create_data_~data~0.base) .cse4) .cse11) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))))))))))))))) is different from false [2024-11-08 17:14:53,790 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_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_852))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_855))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse8 .cse7 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_853) .cse6 v_ArrVal_854) .cse7 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ (mod (+ (* .cse0 3) 3) 4) .cse0) (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4) 8)) (< (+ c_create_data_~counter~0 4) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_852))) (let ((.cse16 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_855))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse18 .cse17 v_ArrVal_856))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_853) .cse16 v_ArrVal_854) .cse17 v_ArrVal_857) .cse15 v_ArrVal_858)) (.cse11 (* c_create_data_~counter~0 4))) (or (< (+ (select (select .cse10 c_create_data_~data~0.base) .cse4) .cse11 20) 0) (let ((.cse13 (store .cse14 .cse15 v_ArrVal_859))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store .cse10 .cse12 v_ArrVal_861) c_create_data_~data~0.base) .cse4) .cse11 27) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))))))))))))))) is different from false [2024-11-08 17:14:57,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_851))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_852))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_855))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_850) .cse7 v_ArrVal_853) .cse8 v_ArrVal_854) .cse9 v_ArrVal_857) .cse6 v_ArrVal_858))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 20) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (< (+ .cse2 (select (select (store .cse0 .cse3 v_ArrVal_861) c_create_data_~data~0.base) .cse1) 27) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_860) c_create_data_~data~0.base) .cse1)))))))))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_851))) (let ((.cse17 (select (select .cse22 c_create_data_~data~0.base) .cse1))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_852))) (let ((.cse18 (select (select .cse21 c_create_data_~data~0.base) .cse1))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_855))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse20 .cse19 v_ArrVal_856))) (let ((.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse14 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_850) .cse17 v_ArrVal_853) .cse18 v_ArrVal_854) .cse19 v_ArrVal_857) .cse16 v_ArrVal_858))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (or (< (+ c_create_data_~counter~0 4) (div (+ (- 1) (* (- 1) .cse13)) 4)) (< (+ .cse13 (mod (+ 3 (* .cse13 3)) 4)) (+ (select (select (store .cse14 (select (select (store .cse15 .cse16 v_ArrVal_859) c_create_data_~data~0.base) .cse1) v_ArrVal_861) c_create_data_~data~0.base) .cse1) 8)))))))))))))))) is different from false [2024-11-08 17:15:02,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_851))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_852))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_855))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_850) .cse8 v_ArrVal_853) .cse9 v_ArrVal_854) .cse10 v_ArrVal_857) .cse6 v_ArrVal_858))) (or (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (< (+ .cse0 27 (select (select (store .cse1 .cse2 v_ArrVal_861) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_860) c_create_data_~data~0.base) .cse3))))) (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse3) 20) 0)))))))))))) (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_851))) (let ((.cse18 (select (select .cse23 c_create_data_~data~0.base) .cse3))) (let ((.cse22 (store .cse23 .cse18 v_ArrVal_852))) (let ((.cse19 (select (select .cse22 c_create_data_~data~0.base) .cse3))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_855))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse3))) (let ((.cse16 (store .cse21 .cse20 v_ArrVal_856))) (let ((.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_850) .cse18 v_ArrVal_853) .cse19 v_ArrVal_854) .cse20 v_ArrVal_857) .cse17 v_ArrVal_858))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse3))) (or (< (+ .cse14 (mod (+ 3 (* 3 .cse14)) 4)) (+ 8 (select (select (store .cse15 (select (select (store .cse16 .cse17 v_ArrVal_859) c_create_data_~data~0.base) .cse3) v_ArrVal_861) c_create_data_~data~0.base) .cse3))) (< (+ c_create_data_~counter~0 4) (div (+ (- 1) (* (- 1) .cse14)) 4))))))))))))))))) is different from false [2024-11-08 17:15:03,678 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_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_851))) (let ((.cse6 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_852))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_855))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse9 .cse8 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_850) .cse6 v_ArrVal_853) .cse7 v_ArrVal_854) .cse8 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 5) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ .cse0 (mod (+ 3 (* 3 .cse0)) 4)) (+ 8 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4))))))))))))))) (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_851))) (let ((.cse18 (select (select .cse23 c_create_data_~data~0.base) .cse4))) (let ((.cse22 (store .cse23 .cse18 v_ArrVal_852))) (let ((.cse19 (select (select .cse22 c_create_data_~data~0.base) .cse4))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_855))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store .cse21 .cse20 v_ArrVal_856))) (let ((.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (* c_create_data_~counter~0 4)) (.cse13 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_850) .cse18 v_ArrVal_853) .cse19 v_ArrVal_854) .cse20 v_ArrVal_857) .cse17 v_ArrVal_858))) (or (< (+ .cse12 (select (select .cse13 c_create_data_~data~0.base) .cse4) 24) 0) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_859))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (< (+ 31 .cse12 (select (select (store .cse13 .cse14 v_ArrVal_861) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))))))))))))))))) is different from false [2024-11-08 17:15:08,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_848))) (let ((.cse7 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_851))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_852))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_855))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_849) .cse7 v_ArrVal_850) .cse8 v_ArrVal_853) .cse9 v_ArrVal_854) .cse10 v_ArrVal_857) .cse6 v_ArrVal_858)) (.cse2 (* c_create_data_~counter~0 4))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 24) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse0 .cse3 v_ArrVal_861) c_create_data_~data~0.base) .cse1) 31 .cse2) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_860) c_create_data_~data~0.base) .cse1)))))))))))))))))) (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_848))) (let ((.cse19 (select (select .cse26 c_create_data_~data~0.base) .cse1))) (let ((.cse25 (store .cse26 .cse19 v_ArrVal_851))) (let ((.cse20 (select (select .cse25 c_create_data_~data~0.base) .cse1))) (let ((.cse24 (store .cse25 .cse20 v_ArrVal_852))) (let ((.cse21 (select (select .cse24 c_create_data_~data~0.base) .cse1))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_855))) (let ((.cse22 (select (select .cse23 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store .cse23 .cse22 v_ArrVal_856))) (let ((.cse18 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_849) .cse19 v_ArrVal_850) .cse20 v_ArrVal_853) .cse21 v_ArrVal_854) .cse22 v_ArrVal_857) .cse18 v_ArrVal_858))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (or (< (+ c_create_data_~counter~0 5) (div (+ (- 1) (* (- 1) .cse15)) 4)) (< (+ .cse15 (mod (+ (* .cse15 3) 3) 4)) (+ (select (select (store .cse16 (select (select (store .cse17 .cse18 v_ArrVal_859) c_create_data_~data~0.base) .cse1) v_ArrVal_861) c_create_data_~data~0.base) .cse1) 8)))))))))))))))))) is different from false [2024-11-08 17:15:13,245 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_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_848))) (let ((.cse6 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse6 v_ArrVal_851))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_852))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_855))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse10 .cse9 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_849) .cse6 v_ArrVal_850) .cse7 v_ArrVal_853) .cse8 v_ArrVal_854) .cse9 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 5) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ (mod (+ (* 3 .cse0) 3) 4) .cse0) (+ 8 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4))))))))))))))))) (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_848))) (let ((.cse20 (select (select .cse27 c_create_data_~data~0.base) .cse4))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_851))) (let ((.cse21 (select (select .cse26 c_create_data_~data~0.base) .cse4))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_852))) (let ((.cse22 (select (select .cse25 c_create_data_~data~0.base) .cse4))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_855))) (let ((.cse23 (select (select .cse24 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store .cse24 .cse23 v_ArrVal_856))) (let ((.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (* c_create_data_~counter~0 4)) (.cse14 (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_849) .cse20 v_ArrVal_850) .cse21 v_ArrVal_853) .cse22 v_ArrVal_854) .cse23 v_ArrVal_857) .cse19 v_ArrVal_858))) (or (< (+ (select (select .cse14 c_create_data_~data~0.base) .cse4) .cse15 24) 0) (let ((.cse17 (store .cse18 .cse19 v_ArrVal_859))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse4))) (< (+ 31 .cse15 (select (select (store .cse14 .cse16 v_ArrVal_861) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))))))))))))))))))) is different from false [2024-11-08 17:15:14,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_848))) (let ((.cse8 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_851))) (let ((.cse9 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_852))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_855))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_849) .cse8 v_ArrVal_850) .cse9 v_ArrVal_853) .cse10 v_ArrVal_854) .cse11 v_ArrVal_857) .cse6 v_ArrVal_858))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 28) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (< (+ 35 .cse2 (select (select (store .cse0 .cse3 v_ArrVal_861) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_860) c_create_data_~data~0.base) .cse1)))))))))))))))))) (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_848))) (let ((.cse20 (select (select .cse27 c_create_data_~data~0.base) .cse1))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_851))) (let ((.cse21 (select (select .cse26 c_create_data_~data~0.base) .cse1))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_852))) (let ((.cse22 (select (select .cse25 c_create_data_~data~0.base) .cse1))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_855))) (let ((.cse23 (select (select .cse24 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse24 .cse23 v_ArrVal_856))) (let ((.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_849) .cse20 v_ArrVal_850) .cse21 v_ArrVal_853) .cse22 v_ArrVal_854) .cse23 v_ArrVal_857) .cse19 v_ArrVal_858))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (or (< (+ c_create_data_~counter~0 6) (div (+ (- 1) (* (- 1) .cse16)) 4)) (< (+ (mod (+ (* 3 .cse16) 3) 4) .cse16) (+ 8 (select (select (store .cse17 (select (select (store .cse18 .cse19 v_ArrVal_859) c_create_data_~data~0.base) .cse1) v_ArrVal_861) c_create_data_~data~0.base) .cse1)))))))))))))))))))) is different from false [2024-11-08 17:15:19,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_847))) (let ((.cse7 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse7 v_ArrVal_848))) (let ((.cse8 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_851))) (let ((.cse9 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_852))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_855))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_856))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (let ((.cse0 (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_846) .cse7 v_ArrVal_849) .cse8 v_ArrVal_850) .cse9 v_ArrVal_853) .cse10 v_ArrVal_854) .cse11 v_ArrVal_857) .cse6 v_ArrVal_858)) (.cse2 (* c_create_data_~counter~0 4))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 28) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_859))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse0 .cse3 v_ArrVal_861) c_create_data_~data~0.base) .cse1) 35 .cse2) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_860) c_create_data_~data~0.base) .cse1)))))))))))))))))))) (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_847))) (let ((.cse21 (select (select .cse30 c_create_data_~data~0.base) .cse1))) (let ((.cse29 (store .cse30 .cse21 v_ArrVal_848))) (let ((.cse22 (select (select .cse29 c_create_data_~data~0.base) .cse1))) (let ((.cse28 (store .cse29 .cse22 v_ArrVal_851))) (let ((.cse23 (select (select .cse28 c_create_data_~data~0.base) .cse1))) (let ((.cse27 (store .cse28 .cse23 v_ArrVal_852))) (let ((.cse24 (select (select .cse27 c_create_data_~data~0.base) .cse1))) (let ((.cse26 (store .cse27 .cse24 v_ArrVal_855))) (let ((.cse25 (select (select .cse26 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse26 .cse25 v_ArrVal_856))) (let ((.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_846) .cse21 v_ArrVal_849) .cse22 v_ArrVal_850) .cse23 v_ArrVal_853) .cse24 v_ArrVal_854) .cse25 v_ArrVal_857) .cse20 v_ArrVal_858))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (or (< (+ (mod (+ 3 (* .cse17 3)) 4) .cse17) (+ (select (select (store .cse18 (select (select (store .cse19 .cse20 v_ArrVal_859) c_create_data_~data~0.base) .cse1) v_ArrVal_861) c_create_data_~data~0.base) .cse1) 8)) (< (+ c_create_data_~counter~0 6) (div (+ (- 1) (* (- 1) .cse17)) 4)))))))))))))))))))) is different from false [2024-11-08 17:15:24,313 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_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_847))) (let ((.cse6 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse6 v_ArrVal_848))) (let ((.cse7 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_851))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_852))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_855))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse11 .cse10 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_846) .cse6 v_ArrVal_849) .cse7 v_ArrVal_850) .cse8 v_ArrVal_853) .cse9 v_ArrVal_854) .cse10 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 6) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ .cse0 (mod (+ 3 (* .cse0 3)) 4)) (+ 8 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4))))))))))))))))))) (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_847))) (let ((.cse22 (select (select .cse31 c_create_data_~data~0.base) .cse4))) (let ((.cse30 (store .cse31 .cse22 v_ArrVal_848))) (let ((.cse23 (select (select .cse30 c_create_data_~data~0.base) .cse4))) (let ((.cse29 (store .cse30 .cse23 v_ArrVal_851))) (let ((.cse24 (select (select .cse29 c_create_data_~data~0.base) .cse4))) (let ((.cse28 (store .cse29 .cse24 v_ArrVal_852))) (let ((.cse25 (select (select .cse28 c_create_data_~data~0.base) .cse4))) (let ((.cse27 (store .cse28 .cse25 v_ArrVal_855))) (let ((.cse26 (select (select .cse27 c_create_data_~data~0.base) .cse4))) (let ((.cse20 (store .cse27 .cse26 v_ArrVal_856))) (let ((.cse21 (select (select .cse20 c_create_data_~data~0.base) .cse4))) (let ((.cse17 (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_846) .cse22 v_ArrVal_849) .cse23 v_ArrVal_850) .cse24 v_ArrVal_853) .cse25 v_ArrVal_854) .cse26 v_ArrVal_857) .cse21 v_ArrVal_858)) (.cse16 (* c_create_data_~counter~0 4))) (or (let ((.cse19 (store .cse20 .cse21 v_ArrVal_859))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (< (+ 35 .cse16 (select (select (store .cse17 .cse18 v_ArrVal_861) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse19 .cse18 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))) (< (+ (select (select .cse17 c_create_data_~data~0.base) .cse4) .cse16 28) 0))))))))))))))))))) is different from false [2024-11-08 17:15:29,098 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_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_847))) (let ((.cse6 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse6 v_ArrVal_848))) (let ((.cse7 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_851))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_852))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_855))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse2 (store .cse11 .cse10 v_ArrVal_856))) (let ((.cse3 (select (select .cse2 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_846) .cse6 v_ArrVal_849) .cse7 v_ArrVal_850) .cse8 v_ArrVal_853) .cse9 v_ArrVal_854) .cse10 v_ArrVal_857) .cse3 v_ArrVal_858))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ .cse0 (mod (+ 3 (* .cse0 3)) 4)) (+ 8 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_859) c_create_data_~data~0.base) .cse4) v_ArrVal_861) c_create_data_~data~0.base) .cse4))) (< 6 (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))))))))))) (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_854 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_847))) (let ((.cse21 (select (select .cse30 c_create_data_~data~0.base) .cse4))) (let ((.cse29 (store .cse30 .cse21 v_ArrVal_848))) (let ((.cse22 (select (select .cse29 c_create_data_~data~0.base) .cse4))) (let ((.cse28 (store .cse29 .cse22 v_ArrVal_851))) (let ((.cse23 (select (select .cse28 c_create_data_~data~0.base) .cse4))) (let ((.cse27 (store .cse28 .cse23 v_ArrVal_852))) (let ((.cse24 (select (select .cse27 c_create_data_~data~0.base) .cse4))) (let ((.cse26 (store .cse27 .cse24 v_ArrVal_855))) (let ((.cse25 (select (select .cse26 c_create_data_~data~0.base) .cse4))) (let ((.cse19 (store .cse26 .cse25 v_ArrVal_856))) (let ((.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_846) .cse21 v_ArrVal_849) .cse22 v_ArrVal_850) .cse23 v_ArrVal_853) .cse24 v_ArrVal_854) .cse25 v_ArrVal_857) .cse20 v_ArrVal_858))) (or (< (+ (select (select .cse16 c_create_data_~data~0.base) .cse4) 28) 0) (let ((.cse18 (store .cse19 .cse20 v_ArrVal_859))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (< (+ 35 (select (select (store .cse16 .cse17 v_ArrVal_861) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse18 .cse17 v_ArrVal_860) c_create_data_~data~0.base) .cse4))))))))))))))))))))))) is different from false [2024-11-08 17:15:29,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:15:29,220 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 7044 treesize of output 7034 [2024-11-08 17:15:29,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:15:29,299 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 7024 treesize of output 3854