./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/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_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:00:41,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:00:41,926 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-23 23:00:41,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:00:41,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:00:41,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:00:41,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:00:41,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:00:41,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:00:41,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:00:41,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:00:41,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:00:41,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:00:41,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:00:41,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:00:41,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:00:41,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:00:41,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:00:41,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:00:41,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:00:41,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:00:41,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:00:41,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:00:41,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:00:41,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:00:41,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:00:41,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:00:41,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:00:41,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:00:41,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:00:42,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:00:42,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:00:42,000 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC 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-23 23:00:42,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:00:42,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:00:42,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:00:42,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:00:42,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:00:42,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-23 23:00:46,314 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/data/56f65352a/1d4387563db44af0b990b67a1c5d306b/FLAG4867b3a38 [2024-11-23 23:00:46,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:00:46,720 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-23 23:00:46,736 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/data/56f65352a/1d4387563db44af0b990b67a1c5d306b/FLAG4867b3a38 [2024-11-23 23:00:46,766 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/data/56f65352a/1d4387563db44af0b990b67a1c5d306b [2024-11-23 23:00:46,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:00:46,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:00:46,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:00:46,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:00:46,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:00:46,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:00:46" (1/1) ... [2024-11-23 23:00:46,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434e7a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:46, skipping insertion in model container [2024-11-23 23:00:46,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:00:46" (1/1) ... [2024-11-23 23:00:46,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:00:47,205 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:00:47,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:00:47,246 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:00:47,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:00:47,344 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:00:47,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47 WrapperNode [2024-11-23 23:00:47,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:00:47,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:00:47,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:00:47,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:00:47,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,411 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-23 23:00:47,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:00:47,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:00:47,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:00:47,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:00:47,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,501 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2024-11-23 23:00:47,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:00:47,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:00:47,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:00:47,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:00:47,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (1/1) ... [2024-11-23 23:00:47,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:00:47,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:00:47,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:00:47,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:00:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 23:00:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 23:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 23:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 23:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 23:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 23:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:00:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-23 23:00:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-23 23:00:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-23 23:00:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:00:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:00:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 23:00:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:00:47,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:00:47,866 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:00:47,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:00:48,819 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-23 23:00:48,819 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:00:48,852 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:00:48,853 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-23 23:00:48,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:00:48 BoogieIcfgContainer [2024-11-23 23:00:48,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:00:48,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:00:48,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:00:48,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:00:48,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:00:46" (1/3) ... [2024-11-23 23:00:48,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5469a403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:00:48, skipping insertion in model container [2024-11-23 23:00:48,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:00:47" (2/3) ... [2024-11-23 23:00:48,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5469a403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:00:48, skipping insertion in model container [2024-11-23 23:00:48,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:00:48" (3/3) ... [2024-11-23 23:00:48,873 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-23 23:00:48,894 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:00:48,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.i that has 2 procedures, 193 locations, 1 initial locations, 4 loop locations, and 92 error locations. [2024-11-23 23:00:48,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:00:48,996 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;@188dfd27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:00:48,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-23 23:00:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 97 states have (on average 2.11340206185567) internal successors, (205), 189 states have internal predecessors, (205), 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-23 23:00:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 23:00:49,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:49,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 23:00:49,015 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-23 23:00:49,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash 4929960, now seen corresponding path program 1 times [2024-11-23 23:00:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936284318] [2024-11-23 23:00:49,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:49,232 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-23 23:00:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936284318] [2024-11-23 23:00:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936284318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:49,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:00:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671242195] [2024-11-23 23:00:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 23:00:49,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:49,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 23:00:49,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:00:49,284 INFO L87 Difference]: Start difference. First operand has 193 states, 97 states have (on average 2.11340206185567) internal successors, (205), 189 states have internal predecessors, (205), 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-23 23:00:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:49,333 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-11-23 23:00:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 23:00:49,336 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-23 23:00:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:49,349 INFO L225 Difference]: With dead ends: 193 [2024-11-23 23:00:49,350 INFO L226 Difference]: Without dead ends: 191 [2024-11-23 23:00:49,353 INFO L434 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-23 23:00:49,358 INFO L435 NwaCegarLoop]: 205 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, 205 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-23 23:00:49,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:00:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-23 23:00:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-23 23:00:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 96 states have (on average 2.0729166666666665) internal successors, (199), 187 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-23 23:00:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2024-11-23 23:00:49,426 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 4 [2024-11-23 23:00:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:49,426 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2024-11-23 23:00:49,426 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-23 23:00:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2024-11-23 23:00:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 23:00:49,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:49,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 23:00:49,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:00:49,427 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-23 23:00:49,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash 4927557, now seen corresponding path program 1 times [2024-11-23 23:00:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067705035] [2024-11-23 23:00:49,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:49,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:49,664 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-23 23:00:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067705035] [2024-11-23 23:00:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067705035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:49,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:49,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:00:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951597418] [2024-11-23 23:00:49,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:49,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:00:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:49,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:00:49,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:00:49,668 INFO L87 Difference]: Start difference. First operand 191 states and 203 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-23 23:00:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:50,106 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2024-11-23 23:00:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:00:50,107 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-23 23:00:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:50,109 INFO L225 Difference]: With dead ends: 185 [2024-11-23 23:00:50,109 INFO L226 Difference]: Without dead ends: 185 [2024-11-23 23:00:50,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:00:50,113 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 312 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-23 23:00:50,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 312 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:00:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-23 23:00:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-23 23:00:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0104166666666665) internal successors, (193), 181 states have internal predecessors, (193), 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-23 23:00:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2024-11-23 23:00:50,139 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2024-11-23 23:00:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:50,140 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2024-11-23 23:00:50,140 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-23 23:00:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2024-11-23 23:00:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 23:00:50,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:50,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 23:00:50,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:00:50,141 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-23 23:00:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 4927558, now seen corresponding path program 1 times [2024-11-23 23:00:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860231359] [2024-11-23 23:00:50,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:50,550 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-23 23:00:50,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:50,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860231359] [2024-11-23 23:00:50,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860231359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:50,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:50,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:00:50,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896293932] [2024-11-23 23:00:50,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:50,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:00:50,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:50,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:00:50,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:00:50,553 INFO L87 Difference]: Start difference. First operand 185 states and 197 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-23 23:00:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:51,064 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2024-11-23 23:00:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:00:51,065 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-23 23:00:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:51,069 INFO L225 Difference]: With dead ends: 201 [2024-11-23 23:00:51,069 INFO L226 Difference]: Without dead ends: 201 [2024-11-23 23:00:51,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:00:51,070 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 352 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.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:00:51,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 352 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:00:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-23 23:00:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-23 23:00:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 186 states have internal predecessors, (200), 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-23 23:00:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-11-23 23:00:51,103 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2024-11-23 23:00:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:51,104 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-11-23 23:00:51,104 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-23 23:00:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-11-23 23:00:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 23:00:51,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:51,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 23:00:51,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:00:51,105 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-23 23:00:51,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash 152754377, now seen corresponding path program 1 times [2024-11-23 23:00:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546588529] [2024-11-23 23:00:51,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:51,212 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-23 23:00:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546588529] [2024-11-23 23:00:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546588529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:00:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357976723] [2024-11-23 23:00:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:51,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:00:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:51,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:00:51,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:51,216 INFO L87 Difference]: Start difference. First operand 190 states and 204 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-23 23:00:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:51,433 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2024-11-23 23:00:51,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:00:51,433 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-23 23:00:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:51,435 INFO L225 Difference]: With dead ends: 188 [2024-11-23 23:00:51,435 INFO L226 Difference]: Without dead ends: 188 [2024-11-23 23:00:51,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:51,437 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 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-23 23:00:51,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:00:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-23 23:00:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-23 23:00:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 101 states have (on average 1.9504950495049505) 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-23 23:00:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2024-11-23 23:00:51,456 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2024-11-23 23:00:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:51,456 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2024-11-23 23:00:51,457 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-23 23:00:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2024-11-23 23:00:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 23:00:51,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:51,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 23:00:51,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:00:51,458 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-23 23:00:51,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 152754378, now seen corresponding path program 1 times [2024-11-23 23:00:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:51,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259224687] [2024-11-23 23:00:51,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:51,572 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-23 23:00:51,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259224687] [2024-11-23 23:00:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259224687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:00:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418153169] [2024-11-23 23:00:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:00:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:51,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:00:51,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:51,576 INFO L87 Difference]: Start difference. First operand 188 states and 201 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-23 23:00:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:51,803 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2024-11-23 23:00:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:00:51,804 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-23 23:00:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:51,805 INFO L225 Difference]: With dead ends: 186 [2024-11-23 23:00:51,806 INFO L226 Difference]: Without dead ends: 186 [2024-11-23 23:00:51,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:51,807 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 282 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-23 23:00:51,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:00:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-23 23:00:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-23 23:00:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 101 states have (on average 1.9207920792079207) internal successors, (194), 182 states have internal predecessors, (194), 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-23 23:00:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2024-11-23 23:00:51,835 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2024-11-23 23:00:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:51,835 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2024-11-23 23:00:51,835 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-23 23:00:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2024-11-23 23:00:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 23:00:51,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:51,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:51,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:00:51,836 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-23 23:00:51,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1957144585, now seen corresponding path program 1 times [2024-11-23 23:00:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:51,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812736139] [2024-11-23 23:00:51,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:52,083 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-23 23:00:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812736139] [2024-11-23 23:00:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812736139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:00:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735832016] [2024-11-23 23:00:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:00:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:52,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:00:52,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:00:52,086 INFO L87 Difference]: Start difference. First operand 186 states and 198 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-23 23:00:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:52,258 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-11-23 23:00:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:00:52,259 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-23 23:00:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:52,260 INFO L225 Difference]: With dead ends: 195 [2024-11-23 23:00:52,260 INFO L226 Difference]: Without dead ends: 195 [2024-11-23 23:00:52,261 INFO L434 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-23 23:00:52,263 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 714 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-23 23:00:52,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 714 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:00:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-23 23:00:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-11-23 23:00:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 102 states have (on average 1.911764705882353) internal successors, (195), 183 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:00:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-23 23:00:52,278 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2024-11-23 23:00:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:52,279 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-23 23:00:52,279 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-23 23:00:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-23 23:00:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 23:00:52,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:52,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:52,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:00:52,280 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-23 23:00:52,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 376655322, now seen corresponding path program 1 times [2024-11-23 23:00:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455911405] [2024-11-23 23:00:52,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:52,440 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-23 23:00:52,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:52,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455911405] [2024-11-23 23:00:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455911405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:52,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:00:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094274555] [2024-11-23 23:00:52,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:52,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:00:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:52,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:00:52,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:00:52,444 INFO L87 Difference]: Start difference. First operand 187 states and 199 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-23 23:00:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:52,501 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2024-11-23 23:00:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:00:52,502 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-23 23:00:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:52,504 INFO L225 Difference]: With dead ends: 266 [2024-11-23 23:00:52,504 INFO L226 Difference]: Without dead ends: 266 [2024-11-23 23:00:52,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:00:52,505 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 83 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 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-23 23:00:52,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:00:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-23 23:00:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2024-11-23 23:00:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 144 states have (on average 1.9305555555555556) internal successors, (278), 225 states have internal predecessors, (278), 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-23 23:00:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2024-11-23 23:00:52,518 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2024-11-23 23:00:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:52,519 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2024-11-23 23:00:52,519 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-23 23:00:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2024-11-23 23:00:52,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:00:52,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:52,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:52,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:00:52,520 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-23 23:00:52,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580717, now seen corresponding path program 1 times [2024-11-23 23:00:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282990723] [2024-11-23 23:00:52,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:52,657 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-23 23:00:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282990723] [2024-11-23 23:00:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282990723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:00:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515514945] [2024-11-23 23:00:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:52,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:00:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:52,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:00:52,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:52,659 INFO L87 Difference]: Start difference. First operand 230 states and 282 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-23 23:00:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:52,882 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2024-11-23 23:00:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:00:52,883 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-23 23:00:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:52,884 INFO L225 Difference]: With dead ends: 215 [2024-11-23 23:00:52,884 INFO L226 Difference]: Without dead ends: 215 [2024-11-23 23:00:52,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:52,885 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 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-23 23:00:52,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:00:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-23 23:00:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-23 23:00:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.7222222222222223) internal successors, (248), 210 states have internal predecessors, (248), 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-23 23:00:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2024-11-23 23:00:52,897 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2024-11-23 23:00:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:52,898 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2024-11-23 23:00:52,898 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-23 23:00:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2024-11-23 23:00:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:00:52,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:52,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:52,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:00:52,899 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-23 23:00:52,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580716, now seen corresponding path program 1 times [2024-11-23 23:00:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574137499] [2024-11-23 23:00:52,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:53,117 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-23 23:00:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574137499] [2024-11-23 23:00:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574137499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:00:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5755349] [2024-11-23 23:00:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:53,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:00:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:53,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:00:53,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:53,119 INFO L87 Difference]: Start difference. First operand 215 states and 252 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-23 23:00:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:53,301 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-11-23 23:00:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:00:53,302 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-23 23:00:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:53,303 INFO L225 Difference]: With dead ends: 200 [2024-11-23 23:00:53,303 INFO L226 Difference]: Without dead ends: 200 [2024-11-23 23:00:53,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:00:53,305 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 207 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-23 23:00:53,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 207 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:00:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-23 23:00:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-23 23:00:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 195 states have internal predecessors, (218), 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-23 23:00:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2024-11-23 23:00:53,316 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2024-11-23 23:00:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:53,317 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2024-11-23 23:00:53,317 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-23 23:00:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2024-11-23 23:00:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-23 23:00:53,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:53,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:53,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:00:53,319 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-23 23:00:53,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461590, now seen corresponding path program 1 times [2024-11-23 23:00:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429654720] [2024-11-23 23:00:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:53,589 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-23 23:00:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429654720] [2024-11-23 23:00:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429654720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:53,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:53,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:00:53,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926380602] [2024-11-23 23:00:53,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:53,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:00:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:53,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:00:53,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:00:53,591 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:00:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:53,933 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2024-11-23 23:00:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:00:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-23 23:00:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:53,939 INFO L225 Difference]: With dead ends: 253 [2024-11-23 23:00:53,940 INFO L226 Difference]: Without dead ends: 253 [2024-11-23 23:00:53,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:00:53,941 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 413 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-23 23:00:53,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 413 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:00:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-23 23:00:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2024-11-23 23:00:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.513157894736842) internal successors, (230), 203 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-23 23:00:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2024-11-23 23:00:53,957 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2024-11-23 23:00:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:53,958 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2024-11-23 23:00:53,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:00:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2024-11-23 23:00:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-23 23:00:53,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:53,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:00:53,960 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-23 23:00:53,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461589, now seen corresponding path program 1 times [2024-11-23 23:00:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:53,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724669664] [2024-11-23 23:00:53,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:54,386 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-23 23:00:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:54,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724669664] [2024-11-23 23:00:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724669664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:00:54,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:00:54,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:00:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501683873] [2024-11-23 23:00:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:00:54,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:00:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:54,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:00:54,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:00:54,389 INFO L87 Difference]: Start difference. First operand 208 states and 234 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:00:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:54,795 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-11-23 23:00:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:00:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-23 23:00:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:54,797 INFO L225 Difference]: With dead ends: 208 [2024-11-23 23:00:54,797 INFO L226 Difference]: Without dead ends: 208 [2024-11-23 23:00:54,798 INFO L434 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-23 23:00:54,798 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:00:54,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 517 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:00:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-23 23:00:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-23 23:00:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.486842105263158) internal successors, (226), 203 states have internal predecessors, (226), 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-23 23:00:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2024-11-23 23:00:54,817 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2024-11-23 23:00:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2024-11-23 23:00:54,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:00:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2024-11-23 23:00:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-23 23:00:54,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:54,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:54,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:00:54,819 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-23 23:00:54,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash 617548676, now seen corresponding path program 1 times [2024-11-23 23:00:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:54,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380822182] [2024-11-23 23:00:54,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:00:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380822182] [2024-11-23 23:00:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380822182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:00:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074710291] [2024-11-23 23:00:55,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:55,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:00:55,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:00:55,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:00:55,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:00:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:55,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 23:00:55,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:00:55,492 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-23 23:00:55,534 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-23 23:00:55,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:00:55,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:00:55,685 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-23 23:00:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:00:55,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:00:55,740 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-23 23:00:55,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-23 23:00:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:00:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074710291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:00:55,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:00:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-23 23:00:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653489663] [2024-11-23 23:00:55,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:00:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:00:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:55,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:00:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=81, Unknown=4, NotChecked=0, Total=110 [2024-11-23 23:00:55,876 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-23 23:00:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:00:56,448 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2024-11-23 23:00:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:00:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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 23 [2024-11-23 23:00:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:00:56,450 INFO L225 Difference]: With dead ends: 209 [2024-11-23 23:00:56,450 INFO L226 Difference]: Without dead ends: 209 [2024-11-23 23:00:56,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=94, Unknown=4, NotChecked=0, Total=132 [2024-11-23 23:00:56,451 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 24 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:00:56,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 975 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:00:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-23 23:00:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-23 23:00:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4736842105263157) internal successors, (224), 202 states have internal predecessors, (224), 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-23 23:00:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-11-23 23:00:56,466 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2024-11-23 23:00:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:00:56,467 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-11-23 23:00:56,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-23 23:00:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-11-23 23:00:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-23 23:00:56,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:00:56,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:00:56,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-23 23:00:56,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-23 23:00:56,673 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-23 23:00:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:00:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash 617548677, now seen corresponding path program 1 times [2024-11-23 23:00:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:00:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873448068] [2024-11-23 23:00:56,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:00:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:00:57,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:00:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873448068] [2024-11-23 23:00:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873448068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:00:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426326797] [2024-11-23 23:00:57,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:00:57,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:00:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:00:57,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:00:57,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:00:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:00:57,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-23 23:00:57,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:00:57,530 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-23 23:00:57,539 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-23 23:00:57,544 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-23 23:00:57,595 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-23 23:00:57,605 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-23 23:00:57,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:00:57,828 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-23 23:00:57,844 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-23 23:00:57,962 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-23 23:00:57,974 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-23 23:00:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:00:58,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:00:58,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-23 23:00:58,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:00:58,487 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-23 23:00:58,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-23 23:00:58,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:00:58,514 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-23 23:00:58,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:00:58,529 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-23 23:00:58,534 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:58,537 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-23 23:00:58,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:58,546 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-23 23:00:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:00:58,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426326797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:00:58,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:00:58,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2024-11-23 23:00:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005316098] [2024-11-23 23:00:58,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:00:58,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-23 23:00:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:00:58,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-23 23:00:58,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=329, Unknown=18, NotChecked=38, Total=462 [2024-11-23 23:00:58,602 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-23 23:01:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:01:00,462 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2024-11-23 23:01:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:01:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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 23 [2024-11-23 23:01:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:01:00,465 INFO L225 Difference]: With dead ends: 227 [2024-11-23 23:01:00,465 INFO L226 Difference]: Without dead ends: 227 [2024-11-23 23:01:00,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=465, Unknown=19, NotChecked=46, Total=650 [2024-11-23 23:01:00,467 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 14 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 3 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:01:00,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1559 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1137 Invalid, 19 Unknown, 86 Unchecked, 1.6s Time] [2024-11-23 23:01:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-23 23:01:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-23 23:01:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.430232558139535) internal successors, (246), 222 states have internal predecessors, (246), 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-23 23:01:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 250 transitions. [2024-11-23 23:01:00,476 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 250 transitions. Word has length 23 [2024-11-23 23:01:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:01:00,476 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 250 transitions. [2024-11-23 23:01:00,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-23 23:01:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 250 transitions. [2024-11-23 23:01:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-23 23:01:00,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:01:00,478 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:01:00,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:01:00,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-23 23:01:00,683 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-23 23:01:00,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:01:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1733158075, now seen corresponding path program 2 times [2024-11-23 23:01:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:01:00,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944052647] [2024-11-23 23:01:00,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:01:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:01:00,744 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:01:00,746 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:01:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:01:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:01:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944052647] [2024-11-23 23:01:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944052647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:01:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572396412] [2024-11-23 23:01:01,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:01:01,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:01:01,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:01:01,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:01:01,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:01:02,018 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:01:02,018 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:01:02,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-23 23:01:02,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:01:02,045 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-23 23:01:02,056 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-23 23:01:02,102 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-23 23:01:02,117 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-23 23:01:02,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:02,337 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-23 23:01:02,352 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-23 23:01:02,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:02,549 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-23 23:01:02,561 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-23 23:01:02,759 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:02,760 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-23 23:01:02,775 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-23 23:01:02,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-23 23:01:02,885 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-23 23:01:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:01:02,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:01:03,109 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-23 23:01:03,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-23 23:01:03,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) .cse1 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310) c_create_data_~data~0.base) .cse2) 8))))) is different from false [2024-11-23 23:01:03,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_307))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_308) .cse3 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_309) c_create_data_~data~0.base) .cse2))))))))) is different from false [2024-11-23 23:01:03,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) .cse0 v_ArrVal_308) (select (select (store .cse1 .cse0 v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310))) c_create_data_~data~0.base) .cse2) .cse3 12))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_307))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) .cse4 v_ArrVal_308) .cse5 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))))))) is different from false [2024-11-23 23:01:06,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:01:06,409 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-23 23:01:06,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:01:06,425 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-23 23:01:06,445 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 6476 treesize of output 5654 [2024-11-23 23:01:06,504 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 1304 treesize of output 1256 [2024-11-23 23:01:06,534 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-23 23:01:06,542 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-23 23:01:06,552 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-23 23:01:06,562 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-23 23:01:06,570 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-23 23:01:06,580 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-23 23:01:06,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:01:06,616 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-23 23:01:06,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:01:06,634 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-23 23:01:06,640 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:01:06,645 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-23 23:01:06,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:01:06,656 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-23 23:01:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 20 not checked. [2024-11-23 23:01:06,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572396412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:01:06,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:01:06,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2024-11-23 23:01:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897983031] [2024-11-23 23:01:06,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:01:06,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-23 23:01:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:01:06,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-23 23:01:06,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=735, Unknown=30, NotChecked=310, Total=1260 [2024-11-23 23:01:06,794 INFO L87 Difference]: Start difference. First operand 227 states and 250 transitions. Second operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-23 23:01:09,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= (+ .cse3 .cse2 8) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_307))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (<= (+ 16 .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_308) .cse4 v_ArrVal_310) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))))) (<= 0 (+ .cse3 .cse2 4)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse2 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_306))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_305) .cse6 v_ArrVal_308) (select (select (store .cse7 .cse6 v_ArrVal_307) c_create_data_~data~0.base) .cse1) v_ArrVal_310))) c_create_data_~data~0.base) .cse1) 12))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_306))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_307))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (<= (+ 16 .cse2 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_305) .cse8 v_ArrVal_308) .cse9 v_ArrVal_310) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_307) c_create_data_~data~0.base) .cse1) v_ArrVal_310) c_create_data_~data~0.base) .cse1) 12)))))) is different from false [2024-11-23 23:01:10,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) .cse3 v_ArrVal_310) c_create_data_~data~0.base) .cse1) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307) c_create_data_~data~0.base) .cse1) v_ArrVal_310) c_create_data_~data~0.base) .cse1) 8))) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 4))) (<= 0 (+ .cse5 .cse2)) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= (+ .cse5 .cse2 4) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 4))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse2)) (<= (+ |c_create_data_#t~mem8.offset| .cse2 4) (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2024-11-23 23:01:10,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) .cse1 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse2) .cse0 4))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse2) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse2)))) (<= 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-23 23:01:10,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse3 .cse2)) (<= (+ .cse3 .cse2 4) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-11-23 23:01:11,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse0)))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse1)) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2024-11-23 23:01:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:01:13,070 INFO L93 Difference]: Finished difference Result 267 states and 294 transitions. [2024-11-23 23:01:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 23:01:13,071 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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 33 [2024-11-23 23:01:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:01:13,073 INFO L225 Difference]: With dead ends: 267 [2024-11-23 23:01:13,074 INFO L226 Difference]: Without dead ends: 267 [2024-11-23 23:01:13,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=318, Invalid=1147, Unknown=57, NotChecked=830, Total=2352 [2024-11-23 23:01:13,076 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 16 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 4 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 751 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:01:13,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1681 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1090 Invalid, 43 Unknown, 751 Unchecked, 4.4s Time] [2024-11-23 23:01:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-23 23:01:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-23 23:01:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.3679245283018868) internal successors, (290), 262 states have internal predecessors, (290), 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-23 23:01:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 294 transitions. [2024-11-23 23:01:13,093 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 294 transitions. Word has length 33 [2024-11-23 23:01:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:01:13,095 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 294 transitions. [2024-11-23 23:01:13,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-23 23:01:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 294 transitions. [2024-11-23 23:01:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-23 23:01:13,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:01:13,098 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:01:13,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 23:01:13,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-23 23:01:13,303 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-23 23:01:13,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:01:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1907637826, now seen corresponding path program 1 times [2024-11-23 23:01:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:01:13,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006426645] [2024-11-23 23:01:13,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:01:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:01:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:01:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-23 23:01:13,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:01:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006426645] [2024-11-23 23:01:13,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006426645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:01:13,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:01:13,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:01:13,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923041416] [2024-11-23 23:01:13,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:01:13,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:01:13,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:01:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:01:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:01:13,461 INFO L87 Difference]: Start difference. First operand 267 states and 294 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-23 23:01:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:01:13,690 INFO L93 Difference]: Finished difference Result 265 states and 290 transitions. [2024-11-23 23:01:13,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:01:13,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 45 [2024-11-23 23:01:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:01:13,693 INFO L225 Difference]: With dead ends: 265 [2024-11-23 23:01:13,693 INFO L226 Difference]: Without dead ends: 265 [2024-11-23 23:01:13,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:01:13,694 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 239 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.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:01:13,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 239 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:01:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-23 23:01:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-11-23 23:01:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 212 states have (on average 1.349056603773585) internal successors, (286), 260 states have internal predecessors, (286), 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-23 23:01:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 290 transitions. [2024-11-23 23:01:13,709 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 290 transitions. Word has length 45 [2024-11-23 23:01:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:01:13,710 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 290 transitions. [2024-11-23 23:01:13,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-23 23:01:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 290 transitions. [2024-11-23 23:01:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-23 23:01:13,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:01:13,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:01:13,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:01:13,714 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-23 23:01:13,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:01:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1907637825, now seen corresponding path program 1 times [2024-11-23 23:01:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:01:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987451061] [2024-11-23 23:01:13,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:01:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:01:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:01:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:01:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:01:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987451061] [2024-11-23 23:01:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987451061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:01:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538317561] [2024-11-23 23:01:13,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:01:13,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:01:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:01:13,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:01:13,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:01:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:01:14,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 23:01:14,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:01:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:01:14,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:01:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:01:14,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538317561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:01:14,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:01:14,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-23 23:01:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007713688] [2024-11-23 23:01:14,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:01:14,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:01:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:01:14,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:01:14,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:01:14,483 INFO L87 Difference]: Start difference. First operand 265 states and 290 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-23 23:01:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:01:14,613 INFO L93 Difference]: Finished difference Result 289 states and 312 transitions. [2024-11-23 23:01:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 23:01:14,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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 45 [2024-11-23 23:01:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:01:14,616 INFO L225 Difference]: With dead ends: 289 [2024-11-23 23:01:14,616 INFO L226 Difference]: Without dead ends: 289 [2024-11-23 23:01:14,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:01:14,617 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:01:14,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 630 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:01:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-23 23:01:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-23 23:01:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 236 states have (on average 1.305084745762712) internal successors, (308), 284 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-23 23:01:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 312 transitions. [2024-11-23 23:01:14,627 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 312 transitions. Word has length 45 [2024-11-23 23:01:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:01:14,627 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 312 transitions. [2024-11-23 23:01:14,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-23 23:01:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 312 transitions. [2024-11-23 23:01:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-23 23:01:14,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:01:14,629 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:01:14,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 23:01:14,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-23 23:01:14,830 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-23 23:01:14,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:01:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -330159419, now seen corresponding path program 3 times [2024-11-23 23:01:14,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:01:14,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155407848] [2024-11-23 23:01:14,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:01:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:01:15,067 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-23 23:01:15,067 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:01:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:01:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:01:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155407848] [2024-11-23 23:01:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155407848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:01:17,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646077254] [2024-11-23 23:01:17,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:01:17,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:01:17,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:01:17,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:01:17,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47cecc56-35d8-4358-ac1c-d9186ee7dd8a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:01:18,654 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-23 23:01:18,654 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:01:18,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-23 23:01:18,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:01:18,680 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-23 23:01:18,696 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-23 23:01:18,718 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-23 23:01:18,735 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-23 23:01:18,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:18,965 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-23 23:01:18,981 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-23 23:01:19,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:19,291 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-23 23:01:19,303 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-23 23:01:19,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:19,611 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-23 23:01:19,625 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-23 23:01:19,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:19,924 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-23 23:01:19,934 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-23 23:01:20,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:20,233 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-23 23:01:20,240 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-23 23:01:20,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:20,559 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-23 23:01:20,576 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-23 23:01:20,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:01:20,871 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-23 23:01:20,884 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-23 23:01:21,023 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-23 23:01:21,046 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-23 23:01:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:01:21,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:01:21,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_609) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-23 23:01:21,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_610 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_609) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-23 23:01:21,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_608) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_607) c_create_data_~data~0.base) .cse0) v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 8))) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_607))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_608) .cse2 v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_609) c_create_data_~data~0.base) .cse0)))))))) is different from false [2024-11-23 23:01:21,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_607))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_608) .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_609) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_608) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_607) c_create_data_~data~0.base) .cse2) v_ArrVal_610) c_create_data_~data~0.base) .cse2) .cse3 12)))))) is different from false [2024-11-23 23:01:21,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_606))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_607))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_605) .cse0 v_ArrVal_608) .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_609) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_606))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_605) .cse6 v_ArrVal_608) (select (select (store .cse7 .cse6 v_ArrVal_607) c_create_data_~data~0.base) .cse2) v_ArrVal_610))) c_create_data_~data~0.base) .cse2) .cse3 12))))) is different from false [2024-11-23 23:01:22,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_607))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse1 v_ArrVal_608) .cse2 v_ArrVal_610) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_609) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse7 v_ArrVal_608) (select (select (store .cse8 .cse7 v_ArrVal_607) c_create_data_~data~0.base) .cse3) v_ArrVal_610))) c_create_data_~data~0.base) .cse3) .cse4 12)))))) is different from false [2024-11-23 23:01:22,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_607))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse1 v_ArrVal_608) .cse2 v_ArrVal_610) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_609) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ 16 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse7 v_ArrVal_608) (select (select (store .cse8 .cse7 v_ArrVal_607) c_create_data_~data~0.base) .cse3) v_ArrVal_610))) c_create_data_~data~0.base) .cse3) .cse4)))))) is different from false [2024-11-23 23:01:22,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_604))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_606))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_603) .cse1 v_ArrVal_605) .cse2 v_ArrVal_608) (select (select (store .cse3 .cse2 v_ArrVal_607) c_create_data_~data~0.base) .cse4) v_ArrVal_610))))) c_create_data_~data~0.base) .cse4)))) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_604))) (let ((.cse6 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_606))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_607))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (<= (+ .cse0 20 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_603) .cse6 v_ArrVal_605) .cse7 v_ArrVal_608) .cse8 v_ArrVal_610) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_609) c_create_data_~data~0.base) .cse4)))))))))))) is different from false [2024-11-23 23:01:23,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4)) (.cse5 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_606))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_607))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) .cse2 v_ArrVal_608) .cse3 v_ArrVal_610) c_create_data_~data~0.base) .cse4) .cse5 20) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_609) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_606))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse9 v_ArrVal_605) .cse10 v_ArrVal_608) (select (select (store .cse11 .cse10 v_ArrVal_607) c_create_data_~data~0.base) .cse4) v_ArrVal_610))))) c_create_data_~data~0.base) .cse4) 16 .cse5)))))) is different from false [2024-11-23 23:01:23,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4)) (.cse5 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_606))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_607))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) .cse2 v_ArrVal_608) .cse3 v_ArrVal_610) c_create_data_~data~0.base) .cse4) .cse5 24) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_609) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_606))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse9 v_ArrVal_605) .cse10 v_ArrVal_608) (select (select (store .cse11 .cse10 v_ArrVal_607) c_create_data_~data~0.base) .cse4) v_ArrVal_610))))) c_create_data_~data~0.base) .cse4) .cse5 20)))))) is different from false [2024-11-23 23:01:23,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse5 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_601))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_607))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) .cse4 v_ArrVal_610) c_create_data_~data~0.base) .cse5) 24) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_609) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_601))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_604))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_606))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_602) .cse10 v_ArrVal_603) .cse11 v_ArrVal_605) .cse12 v_ArrVal_608) (select (select (store .cse13 .cse12 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))) c_create_data_~data~0.base) .cse5) 20))))) is different from false [2024-11-23 23:01:29,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) (select (select (store .cse4 .cse3 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))) c_create_data_~data~0.base) .cse5) .cse8 20))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_604))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_606))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_607))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse9 v_ArrVal_603) .cse10 v_ArrVal_605) .cse11 v_ArrVal_608) .cse12 v_ArrVal_610) c_create_data_~data~0.base) .cse5) .cse8 24) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_609) c_create_data_~data~0.base) .cse5))))))))))))))) is different from false [2024-11-23 23:01:29,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) (select (select (store .cse4 .cse3 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))) c_create_data_~data~0.base) .cse5) .cse8 24))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_604))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_606))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_607))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse9 v_ArrVal_603) .cse10 v_ArrVal_605) .cse11 v_ArrVal_608) .cse12 v_ArrVal_610) c_create_data_~data~0.base) .cse5) .cse8 28) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_609) c_create_data_~data~0.base) .cse5))))))))))))))) is different from false [2024-11-23 23:01:34,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_create_data_~counter~0 4)) (.cse5 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_600))) (let ((.cse0 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_599) .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) (select (select (store .cse4 .cse3 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))))) c_create_data_~data~0.base) .cse5) .cse9 24))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_600))) (let ((.cse10 (select (select .cse19 c_create_data_~data~0.base) .cse5))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_601))) (let ((.cse11 (select (select .cse18 c_create_data_~data~0.base) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_604))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_606))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_607))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_599) .cse10 v_ArrVal_602) .cse11 v_ArrVal_603) .cse12 v_ArrVal_605) .cse13 v_ArrVal_608) .cse14 v_ArrVal_610) c_create_data_~data~0.base) .cse5) .cse9 28) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_609) c_create_data_~data~0.base) .cse5)))))))))))))))) is different from false [2024-11-23 23:01:38,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse6)) (.cse7 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_601))) (let ((.cse2 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_604))) (let ((.cse3 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_606))) (let ((.cse4 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_607))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_599) .cse1 v_ArrVal_602) .cse2 v_ArrVal_603) .cse3 v_ArrVal_605) .cse4 v_ArrVal_608) .cse5 v_ArrVal_610) c_create_data_~data~0.base) .cse6) .cse7 28) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_609) c_create_data_~data~0.base) .cse6)))))))))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_601))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_604))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_606))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_599) .cse13 v_ArrVal_602) .cse14 v_ArrVal_603) .cse15 v_ArrVal_605) .cse16 v_ArrVal_608) (select (select (store .cse17 .cse16 v_ArrVal_607) c_create_data_~data~0.base) .cse6) v_ArrVal_610))))))))) c_create_data_~data~0.base) .cse6) .cse7 24)))))) is different from false [2024-11-23 23:01:39,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse6)) (.cse7 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_601))) (let ((.cse2 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_604))) (let ((.cse3 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_606))) (let ((.cse4 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_607))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_599) .cse1 v_ArrVal_602) .cse2 v_ArrVal_603) .cse3 v_ArrVal_605) .cse4 v_ArrVal_608) .cse5 v_ArrVal_610) c_create_data_~data~0.base) .cse6) 32 .cse7) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_609) c_create_data_~data~0.base) .cse6)))))))))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_601))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_604))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_606))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_599) .cse13 v_ArrVal_602) .cse14 v_ArrVal_603) .cse15 v_ArrVal_605) .cse16 v_ArrVal_608) (select (select (store .cse17 .cse16 v_ArrVal_607) c_create_data_~data~0.base) .cse6) v_ArrVal_610))))))))) c_create_data_~data~0.base) .cse6) .cse7 28)))))) is different from false [2024-11-23 23:01:43,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4)) (.cse7 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_598))) (let ((.cse0 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_601))) (let ((.cse2 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_604))) (let ((.cse3 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_606))) (let ((.cse4 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_607))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (<= (+ 32 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_597) .cse0 v_ArrVal_599) .cse1 v_ArrVal_602) .cse2 v_ArrVal_603) .cse3 v_ArrVal_605) .cse4 v_ArrVal_608) .cse5 v_ArrVal_610) c_create_data_~data~0.base) .cse6) .cse7) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_609) c_create_data_~data~0.base) .cse6)))))))))))))))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_598))) (let ((.cse14 (select (select .cse23 c_create_data_~data~0.base) .cse6))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_600))) (let ((.cse15 (select (select .cse22 c_create_data_~data~0.base) .cse6))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_601))) (let ((.cse16 (select (select .cse21 c_create_data_~data~0.base) .cse6))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_604))) (let ((.cse17 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_606))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_597) .cse14 v_ArrVal_599) .cse15 v_ArrVal_602) .cse16 v_ArrVal_603) .cse17 v_ArrVal_605) .cse18 v_ArrVal_608) (select (select (store .cse19 .cse18 v_ArrVal_607) c_create_data_~data~0.base) .cse6) v_ArrVal_610))))))))))) c_create_data_~data~0.base) .cse6) .cse7 28))))) is different from false [2024-11-23 23:01:48,087 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse8))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_598))) (let ((.cse2 (select (select .cse14 c_create_data_~data~0.base) .cse8))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_600))) (let ((.cse3 (select (select .cse13 c_create_data_~data~0.base) .cse8))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_601))) (let ((.cse4 (select (select .cse12 c_create_data_~data~0.base) .cse8))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_604))) (let ((.cse5 (select (select .cse11 c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_606))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_607))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (<= (+ 32 .cse0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_597) .cse2 v_ArrVal_599) .cse3 v_ArrVal_602) .cse4 v_ArrVal_603) .cse5 v_ArrVal_605) .cse6 v_ArrVal_608) .cse7 v_ArrVal_610) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_609) c_create_data_~data~0.base) .cse8)))))))))))))))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_598))) (let ((.cse15 (select (select .cse24 c_create_data_~data~0.base) .cse8))) (let ((.cse23 (store .cse24 .cse15 v_ArrVal_600))) (let ((.cse16 (select (select .cse23 c_create_data_~data~0.base) .cse8))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_601))) (let ((.cse17 (select (select .cse22 c_create_data_~data~0.base) .cse8))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_604))) (let ((.cse18 (select (select .cse21 c_create_data_~data~0.base) .cse8))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_606))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse8))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_597) .cse15 v_ArrVal_599) .cse16 v_ArrVal_602) .cse17 v_ArrVal_603) .cse18 v_ArrVal_605) .cse19 v_ArrVal_608) (select (select (store .cse20 .cse19 v_ArrVal_607) c_create_data_~data~0.base) .cse8) v_ArrVal_610))))))))))) c_create_data_~data~0.base) .cse8) 28)))))) is different from false [2024-11-23 23:01:52,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse7))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_598))) (let ((.cse1 (select (select .cse13 c_create_data_~data~0.base) .cse7))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_600))) (let ((.cse2 (select (select .cse12 c_create_data_~data~0.base) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_601))) (let ((.cse3 (select (select .cse11 c_create_data_~data~0.base) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_604))) (let ((.cse4 (select (select .cse10 c_create_data_~data~0.base) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_606))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_607))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (<= (+ 32 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_597) .cse1 v_ArrVal_599) .cse2 v_ArrVal_602) .cse3 v_ArrVal_603) .cse4 v_ArrVal_605) .cse5 v_ArrVal_608) .cse6 v_ArrVal_610) c_create_data_~data~0.base) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_609) c_create_data_~data~0.base) .cse7)))))))))))))))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_598))) (let ((.cse14 (select (select .cse23 c_create_data_~data~0.base) .cse7))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_600))) (let ((.cse15 (select (select .cse22 c_create_data_~data~0.base) .cse7))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_601))) (let ((.cse16 (select (select .cse21 c_create_data_~data~0.base) .cse7))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_604))) (let ((.cse17 (select (select .cse20 c_create_data_~data~0.base) .cse7))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_606))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_597) .cse14 v_ArrVal_599) .cse15 v_ArrVal_602) .cse16 v_ArrVal_603) .cse17 v_ArrVal_605) .cse18 v_ArrVal_608) (select (select (store .cse19 .cse18 v_ArrVal_607) c_create_data_~data~0.base) .cse7) v_ArrVal_610))))))))))) c_create_data_~data~0.base) .cse7) 28)))))) is different from false [2024-11-23 23:01:52,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:01:52,933 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 2817 treesize of output 2818 [2024-11-23 23:01:52,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:01:52,985 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 2807 treesize of output 1548