./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/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_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB --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-d790fec [2024-11-27 20:12:57,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:12:57,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:12:57,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:12:57,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:12:57,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:12:57,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:12:57,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:12:57,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:12:57,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:12:57,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:12:57,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:12:57,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:12:57,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:12:57,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:12:57,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:12:57,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:12:57,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:12:57,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:12:57,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:12:57,227 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:12:57,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:12:57,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:12:57,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:12:57,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:12:57,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:12:57,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:12:57,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:12:57,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:12:57,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:12:57,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:12:57,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:12:57,229 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_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB 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-27 20:12:57,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:12:57,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:12:57,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:12:57,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:12:57,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:12:57,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-27 20:13:00,673 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/b4bc5447a/a795fa6d68324b37ab67b292178ba3f7/FLAG7e98e79f1 [2024-11-27 20:13:01,042 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:13:01,043 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-27 20:13:01,056 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/b4bc5447a/a795fa6d68324b37ab67b292178ba3f7/FLAG7e98e79f1 [2024-11-27 20:13:01,072 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/b4bc5447a/a795fa6d68324b37ab67b292178ba3f7 [2024-11-27 20:13:01,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:13:01,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:13:01,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:01,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:13:01,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:13:01,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a65956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01, skipping insertion in model container [2024-11-27 20:13:01,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:13:01,522 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-27 20:13:01,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:01,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:13:01,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:01,663 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:13:01,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01 WrapperNode [2024-11-27 20:13:01,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:01,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:01,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:13:01,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:13:01,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,716 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-27 20:13:01,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:01,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:13:01,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:13:01,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:13:01,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,768 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2024-11-27 20:13:01,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:13:01,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:13:01,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:13:01,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:13:01,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (1/1) ... [2024-11-27 20:13:01,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:01,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:01,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:13:01,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:13:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:13:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:13:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:13:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:13:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:13:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:13:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-27 20:13:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-27 20:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:13:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:13:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:13:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:13:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:13:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:13:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:13:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 20:13:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:13:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:13:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:13:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:13:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:13:02,037 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:13:02,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:13:02,698 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-27 20:13:02,698 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:13:02,714 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:13:02,714 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-27 20:13:02,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:02 BoogieIcfgContainer [2024-11-27 20:13:02,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:13:02,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:13:02,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:13:02,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:13:02,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:13:01" (1/3) ... [2024-11-27 20:13:02,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e19ffba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:02, skipping insertion in model container [2024-11-27 20:13:02,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:01" (2/3) ... [2024-11-27 20:13:02,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e19ffba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:02, skipping insertion in model container [2024-11-27 20:13:02,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:02" (3/3) ... [2024-11-27 20:13:02,725 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-27 20:13:02,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:13:02,744 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-27 20:13:02,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:13:02,822 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;@245ba16a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:13:02,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-27 20:13:02,828 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-27 20:13:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 20:13:02,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:02,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 20:13:02,835 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-27 20:13:02,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash 4929960, now seen corresponding path program 1 times [2024-11-27 20:13:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780826813] [2024-11-27 20:13:02,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:02,993 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-27 20:13:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:02,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780826813] [2024-11-27 20:13:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780826813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:02,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:13:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212341677] [2024-11-27 20:13:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:03,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:13:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:03,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:13:03,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:13:03,066 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-27 20:13:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:03,106 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-11-27 20:13:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:13:03,108 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-27 20:13:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:03,120 INFO L225 Difference]: With dead ends: 193 [2024-11-27 20:13:03,120 INFO L226 Difference]: Without dead ends: 191 [2024-11-27 20:13:03,123 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-27 20:13:03,129 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-27 20:13:03,129 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-27 20:13:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-27 20:13:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-27 20:13:03,182 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-27 20:13:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2024-11-27 20:13:03,195 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 4 [2024-11-27 20:13:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:03,196 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2024-11-27 20:13:03,196 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-27 20:13:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2024-11-27 20:13:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 20:13:03,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:03,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 20:13:03,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:13:03,197 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-27 20:13:03,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash 4927557, now seen corresponding path program 1 times [2024-11-27 20:13:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772745267] [2024-11-27 20:13:03,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:03,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:03,494 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-27 20:13:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772745267] [2024-11-27 20:13:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772745267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:03,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:03,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:13:03,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998282773] [2024-11-27 20:13:03,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:03,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:03,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:03,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:03,498 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-27 20:13:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:03,886 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2024-11-27 20:13:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:03,887 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-27 20:13:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:03,888 INFO L225 Difference]: With dead ends: 185 [2024-11-27 20:13:03,888 INFO L226 Difference]: Without dead ends: 185 [2024-11-27 20:13:03,889 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-27 20:13:03,889 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.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:03,890 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.3s Time] [2024-11-27 20:13:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-27 20:13:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-27 20:13:03,909 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-27 20:13:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2024-11-27 20:13:03,911 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2024-11-27 20:13:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:03,914 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2024-11-27 20:13:03,914 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-27 20:13:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2024-11-27 20:13:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 20:13:03,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:03,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 20:13:03,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:13:03,915 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-27 20:13:03,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash 4927558, now seen corresponding path program 1 times [2024-11-27 20:13:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451680617] [2024-11-27 20:13:03,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:04,164 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-27 20:13:04,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451680617] [2024-11-27 20:13:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451680617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:04,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:04,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:13:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142066647] [2024-11-27 20:13:04,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:04,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:04,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:04,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:04,166 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-27 20:13:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:04,598 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2024-11-27 20:13:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:04,602 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-27 20:13:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:04,604 INFO L225 Difference]: With dead ends: 201 [2024-11-27 20:13:04,605 INFO L226 Difference]: Without dead ends: 201 [2024-11-27 20:13:04,605 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-27 20:13:04,606 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:04,606 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.4s Time] [2024-11-27 20:13:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-27 20:13:04,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-27 20:13:04,627 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-27 20:13:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-11-27 20:13:04,629 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2024-11-27 20:13:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:04,629 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-11-27 20:13:04,629 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-27 20:13:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-11-27 20:13:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 20:13:04,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:04,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:13:04,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:13:04,635 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-27 20:13:04,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash 152754377, now seen corresponding path program 1 times [2024-11-27 20:13:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740788452] [2024-11-27 20:13:04,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:04,725 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-27 20:13:04,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:04,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740788452] [2024-11-27 20:13:04,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740788452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:04,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:04,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:13:04,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255624595] [2024-11-27 20:13:04,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:04,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:13:04,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:04,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:13:04,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:13:04,728 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-27 20:13:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:04,905 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2024-11-27 20:13:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:13:04,906 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-27 20:13:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:04,907 INFO L225 Difference]: With dead ends: 188 [2024-11-27 20:13:04,907 INFO L226 Difference]: Without dead ends: 188 [2024-11-27 20:13:04,907 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-27 20:13:04,908 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-27 20:13:04,911 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-27 20:13:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-27 20:13:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-27 20:13:04,925 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-27 20:13:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2024-11-27 20:13:04,927 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2024-11-27 20:13:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:04,927 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2024-11-27 20:13:04,927 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-27 20:13:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2024-11-27 20:13:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 20:13:04,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:04,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:13:04,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:13:04,928 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-27 20:13:04,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash 152754378, now seen corresponding path program 1 times [2024-11-27 20:13:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174873008] [2024-11-27 20:13:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:05,006 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-27 20:13:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:05,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174873008] [2024-11-27 20:13:05,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174873008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:05,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:13:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371020108] [2024-11-27 20:13:05,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:05,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:13:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:05,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:13:05,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:13:05,008 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-27 20:13:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:05,182 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2024-11-27 20:13:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:13:05,183 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-27 20:13:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:05,184 INFO L225 Difference]: With dead ends: 186 [2024-11-27 20:13:05,184 INFO L226 Difference]: Without dead ends: 186 [2024-11-27 20:13:05,184 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-27 20:13:05,185 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-27 20:13:05,185 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-27 20:13:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-27 20:13:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-27 20:13:05,191 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-27 20:13:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2024-11-27 20:13:05,192 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2024-11-27 20:13:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:05,192 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2024-11-27 20:13:05,192 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-27 20:13:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2024-11-27 20:13:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 20:13:05,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:05,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:05,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:13:05,193 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-27 20:13:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1957144585, now seen corresponding path program 1 times [2024-11-27 20:13:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009463502] [2024-11-27 20:13:05,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:05,378 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-27 20:13:05,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009463502] [2024-11-27 20:13:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009463502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:05,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:05,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145716122] [2024-11-27 20:13:05,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:05,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:05,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:05,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:05,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:05,380 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-27 20:13:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:05,527 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-11-27 20:13:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:05,528 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-27 20:13:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:05,529 INFO L225 Difference]: With dead ends: 195 [2024-11-27 20:13:05,530 INFO L226 Difference]: Without dead ends: 195 [2024-11-27 20:13:05,530 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-27 20:13:05,531 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-27 20:13:05,534 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-27 20:13:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-27 20:13:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-11-27 20:13:05,543 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-27 20:13:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-27 20:13:05,548 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2024-11-27 20:13:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:05,549 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-27 20:13:05,549 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-27 20:13:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-27 20:13:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 20:13:05,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:05,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:05,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:13:05,550 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-27 20:13:05,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 376655322, now seen corresponding path program 1 times [2024-11-27 20:13:05,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:05,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618796647] [2024-11-27 20:13:05,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:05,730 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-27 20:13:05,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:05,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618796647] [2024-11-27 20:13:05,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618796647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:05,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:05,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:13:05,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720087151] [2024-11-27 20:13:05,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:05,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:05,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:05,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:05,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:05,734 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-27 20:13:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:05,796 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2024-11-27 20:13:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:05,797 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-27 20:13:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:05,799 INFO L225 Difference]: With dead ends: 266 [2024-11-27 20:13:05,799 INFO L226 Difference]: Without dead ends: 266 [2024-11-27 20:13:05,799 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-27 20:13:05,800 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-27 20:13:05,800 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-27 20:13:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-27 20:13:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2024-11-27 20:13:05,814 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-27 20:13:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2024-11-27 20:13:05,817 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2024-11-27 20:13:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:05,817 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2024-11-27 20:13:05,818 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-27 20:13:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2024-11-27 20:13:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:13:05,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:05,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:05,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:13:05,819 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-27 20:13:05,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580717, now seen corresponding path program 1 times [2024-11-27 20:13:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41220268] [2024-11-27 20:13:05,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:05,959 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-27 20:13:05,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:05,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41220268] [2024-11-27 20:13:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41220268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:05,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:13:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71645451] [2024-11-27 20:13:05,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:05,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:13:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:05,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:13:05,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:13:05,961 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-27 20:13:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:06,155 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2024-11-27 20:13:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:13:06,156 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-27 20:13:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:06,157 INFO L225 Difference]: With dead ends: 215 [2024-11-27 20:13:06,157 INFO L226 Difference]: Without dead ends: 215 [2024-11-27 20:13:06,158 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-27 20:13:06,158 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-27 20:13:06,159 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-27 20:13:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-27 20:13:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-27 20:13:06,166 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-27 20:13:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2024-11-27 20:13:06,167 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2024-11-27 20:13:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:06,168 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2024-11-27 20:13:06,168 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-27 20:13:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2024-11-27 20:13:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:13:06,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:06,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:06,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:13:06,169 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-27 20:13:06,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580716, now seen corresponding path program 1 times [2024-11-27 20:13:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760563640] [2024-11-27 20:13:06,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:06,339 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-27 20:13:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760563640] [2024-11-27 20:13:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760563640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:13:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493560079] [2024-11-27 20:13:06,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:06,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:13:06,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:06,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:13:06,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:13:06,341 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-27 20:13:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:06,511 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-11-27 20:13:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:13:06,512 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-27 20:13:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:06,513 INFO L225 Difference]: With dead ends: 200 [2024-11-27 20:13:06,513 INFO L226 Difference]: Without dead ends: 200 [2024-11-27 20:13:06,514 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-27 20:13:06,514 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-27 20:13:06,514 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-27 20:13:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-27 20:13:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-27 20:13:06,525 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-27 20:13:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2024-11-27 20:13:06,527 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2024-11-27 20:13:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:06,527 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2024-11-27 20:13:06,528 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-27 20:13:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2024-11-27 20:13:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 20:13:06,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:06,529 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-27 20:13:06,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:13:06,530 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-27 20:13:06,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461590, now seen corresponding path program 1 times [2024-11-27 20:13:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:06,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794260142] [2024-11-27 20:13:06,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:06,741 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-27 20:13:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794260142] [2024-11-27 20:13:06,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794260142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:06,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:06,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:13:06,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998831917] [2024-11-27 20:13:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:06,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:06,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:06,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:06,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:06,744 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-27 20:13:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:07,041 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2024-11-27 20:13:07,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:07,042 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-27 20:13:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:07,044 INFO L225 Difference]: With dead ends: 253 [2024-11-27 20:13:07,044 INFO L226 Difference]: Without dead ends: 253 [2024-11-27 20:13:07,044 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-27 20:13:07,045 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-27 20:13:07,045 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-27 20:13:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-27 20:13:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2024-11-27 20:13:07,052 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-27 20:13:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2024-11-27 20:13:07,055 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2024-11-27 20:13:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:07,055 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2024-11-27 20:13:07,056 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-27 20:13:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2024-11-27 20:13:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 20:13:07,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:07,056 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-27 20:13:07,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:13:07,057 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-27 20:13:07,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461589, now seen corresponding path program 1 times [2024-11-27 20:13:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222299383] [2024-11-27 20:13:07,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:07,475 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-27 20:13:07,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:07,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222299383] [2024-11-27 20:13:07,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222299383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:07,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989531577] [2024-11-27 20:13:07,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:07,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:13:07,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:07,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:13:07,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:13:07,476 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-27 20:13:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:07,863 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-11-27 20:13:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:13:07,864 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-27 20:13:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:07,865 INFO L225 Difference]: With dead ends: 208 [2024-11-27 20:13:07,865 INFO L226 Difference]: Without dead ends: 208 [2024-11-27 20:13:07,865 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-27 20:13:07,866 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.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:07,866 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.3s Time] [2024-11-27 20:13:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-27 20:13:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-27 20:13:07,879 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-27 20:13:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2024-11-27 20:13:07,884 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2024-11-27 20:13:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2024-11-27 20:13:07,884 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-27 20:13:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2024-11-27 20:13:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:13:07,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:07,885 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-27 20:13:07,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:13:07,885 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-27 20:13:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 617548676, now seen corresponding path program 1 times [2024-11-27 20:13:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97331306] [2024-11-27 20:13:07,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:08,286 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-27 20:13:08,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97331306] [2024-11-27 20:13:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97331306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526347158] [2024-11-27 20:13:08,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:08,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:08,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:08,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:08,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:13:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:08,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-27 20:13:08,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:08,510 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 20:13:08,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-27 20:13:08,567 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-27 20:13:08,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:08,700 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-27 20:13:08,741 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-27 20:13:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:13:08,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:08,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:08,899 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-27 20:13:08,903 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-27 20:13:08,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-27 20:13:08,958 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-27 20:13:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526347158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:13:08,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:13:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-27 20:13:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449682281] [2024-11-27 20:13:08,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:13:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 20:13:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:08,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 20:13:08,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=129, Unknown=9, NotChecked=0, Total=182 [2024-11-27 20:13:08,960 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-27 20:13:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:09,547 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2024-11-27 20:13:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:09,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-27 20:13:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:09,549 INFO L225 Difference]: With dead ends: 209 [2024-11-27 20:13:09,549 INFO L226 Difference]: Without dead ends: 209 [2024-11-27 20:13:09,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=129, Unknown=9, NotChecked=0, Total=182 [2024-11-27 20:13:09,550 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 44 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:09,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 788 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:13:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-27 20:13:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-27 20:13:09,556 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-27 20:13:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-11-27 20:13:09,557 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2024-11-27 20:13:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:09,558 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-11-27 20:13:09,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-27 20:13:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-11-27 20:13:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:13:09,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:09,559 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-27 20:13:09,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:13:09,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-27 20:13:09,760 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-27 20:13:09,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash 617548677, now seen corresponding path program 1 times [2024-11-27 20:13:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:09,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801639359] [2024-11-27 20:13:09,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:09,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:10,319 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-27 20:13:10,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:10,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801639359] [2024-11-27 20:13:10,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801639359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:10,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393807176] [2024-11-27 20:13:10,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:10,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:10,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:10,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:13:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:10,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-27 20:13:10,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:10,465 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-27 20:13:10,479 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-27 20:13:10,510 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-27 20:13:10,523 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-27 20:13:10,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:10,714 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-27 20:13:10,725 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-27 20:13:10,815 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-27 20:13:10,824 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-27 20:13:10,858 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-27 20:13:10,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:11,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-27 20:13:11,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2024-11-27 20:13:11,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-27 20:13:11,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:11,085 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-27 20:13:11,089 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-27 20:13:11,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:11,116 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-27 20:13:11,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:11,127 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-27 20:13:11,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:13:11,135 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-27 20:13:11,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:13:11,142 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-27 20:13:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-27 20:13:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393807176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:13:11,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:13:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2024-11-27 20:13:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226972920] [2024-11-27 20:13:11,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:13:11,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-27 20:13:11,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:11,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-27 20:13:11,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2024-11-27 20:13:11,185 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-27 20:13:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:11,878 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2024-11-27 20:13:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:13:11,879 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-27 20:13:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:11,880 INFO L225 Difference]: With dead ends: 217 [2024-11-27 20:13:11,880 INFO L226 Difference]: Without dead ends: 217 [2024-11-27 20:13:11,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=368, Unknown=3, NotChecked=126, Total=600 [2024-11-27 20:13:11,881 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 12 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:11,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 960 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 0 Unknown, 244 Unchecked, 0.5s Time] [2024-11-27 20:13:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-27 20:13:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-27 20:13:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 212 states have internal predecessors, (234), 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-27 20:13:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2024-11-27 20:13:11,895 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 23 [2024-11-27 20:13:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:11,895 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2024-11-27 20:13:11,895 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-27 20:13:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2024-11-27 20:13:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-27 20:13:11,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:11,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:11,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:13:12,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-27 20:13:12,100 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-27 20:13:12,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 731740651, now seen corresponding path program 2 times [2024-11-27 20:13:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:12,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16685423] [2024-11-27 20:13:12,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:13:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:12,143 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:13:12,144 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16685423] [2024-11-27 20:13:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16685423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102337880] [2024-11-27 20:13:12,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:13:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:12,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:12,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:12,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:13:12,951 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:13:12,951 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:12,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-27 20:13:12,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:12,976 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-27 20:13:12,987 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-27 20:13:13,022 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-27 20:13:13,031 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-27 20:13:13,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:13,211 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-27 20:13:13,218 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-27 20:13:13,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:13,377 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-27 20:13:13,389 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-27 20:13:13,472 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-27 20:13:13,480 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-27 20:13:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:13,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:13,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse1) 4))))) is different from false [2024-11-27 20:13:13,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-11-27 20:13:13,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-27 20:13:13,752 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_295))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_295) c_create_data_~data~0.base) .cse1) v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2024-11-27 20:13:13,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_295) c_create_data_~data~0.base) .cse1) v_ArrVal_297) c_create_data_~data~0.base) .cse1) 8))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_295))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) .cse2 v_ArrVal_297) c_create_data_~data~0.base) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_296) c_create_data_~data~0.base) .cse1))))))))) is different from false [2024-11-27 20:13:13,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:13,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-27 20:13:13,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:13,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-27 20:13:13,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-11-27 20:13:13,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 116 [2024-11-27 20:13:13,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-27 20:13:13,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:13:13,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-27 20:13:13,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:13,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-27 20:13:13,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:13,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-27 20:13:13,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:13:14,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2024-11-27 20:13:14,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:13:14,010 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-27 20:13:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-27 20:13:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102337880] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:13:14,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:13:14,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2024-11-27 20:13:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773379378] [2024-11-27 20:13:14,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:13:14,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-27 20:13:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:14,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-27 20:13:14,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=454, Unknown=7, NotChecked=240, Total=812 [2024-11-27 20:13:14,058 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 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-27 20:13:14,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse3 .cse2 4)) (<= (+ .cse3 .cse2 8) (select |c_#length| .cse0)) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-27 20:13:14,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse1 (* c_create_data_~counter~0 4))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ .cse1 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_296) c_create_data_~data~0.base) .cse2)))) (<= (+ .cse0 .cse1 4) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse2) 4))) (<= 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-27 20:13:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:15,769 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2024-11-27 20:13:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:13:15,770 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 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 28 [2024-11-27 20:13:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:15,771 INFO L225 Difference]: With dead ends: 247 [2024-11-27 20:13:15,771 INFO L226 Difference]: Without dead ends: 247 [2024-11-27 20:13:15,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=742, Unknown=26, NotChecked=448, Total=1406 [2024-11-27 20:13:15,773 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 19 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 3 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:15,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1578 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 916 Invalid, 31 Unknown, 524 Unchecked, 1.1s Time] [2024-11-27 20:13:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-27 20:13:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-27 20:13:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 242 states have internal predecessors, (268), 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-27 20:13:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2024-11-27 20:13:15,785 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 28 [2024-11-27 20:13:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:15,785 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2024-11-27 20:13:15,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 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-27 20:13:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2024-11-27 20:13:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 20:13:15,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:15,790 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:15,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:13:15,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 20:13:15,995 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-27 20:13:15,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash -569354396, now seen corresponding path program 1 times [2024-11-27 20:13:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451064789] [2024-11-27 20:13:15,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-27 20:13:16,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:16,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451064789] [2024-11-27 20:13:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451064789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:16,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:16,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:13:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818567694] [2024-11-27 20:13:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:16,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:13:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:16,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:13:16,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:13:16,092 INFO L87 Difference]: Start difference. First operand 247 states and 272 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-27 20:13:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:16,215 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2024-11-27 20:13:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:13:16,215 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 40 [2024-11-27 20:13:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:16,216 INFO L225 Difference]: With dead ends: 245 [2024-11-27 20:13:16,217 INFO L226 Difference]: Without dead ends: 245 [2024-11-27 20:13:16,218 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-27 20:13:16,219 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:16,219 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.1s Time] [2024-11-27 20:13:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-27 20:13:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-27 20:13:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 192 states have (on average 1.375) internal successors, (264), 240 states have internal predecessors, (264), 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-27 20:13:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 268 transitions. [2024-11-27 20:13:16,230 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 268 transitions. Word has length 40 [2024-11-27 20:13:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:16,231 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 268 transitions. [2024-11-27 20:13:16,231 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-27 20:13:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 268 transitions. [2024-11-27 20:13:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 20:13:16,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:16,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:16,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:13:16,232 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-27 20:13:16,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -569354395, now seen corresponding path program 1 times [2024-11-27 20:13:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755768365] [2024-11-27 20:13:16,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:16,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755768365] [2024-11-27 20:13:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755768365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846185704] [2024-11-27 20:13:16,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:16,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:16,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:16,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:16,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:13:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:16,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:13:16,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:16,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:16,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846185704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:13:16,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:13:16,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-27 20:13:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132859130] [2024-11-27 20:13:16,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:13:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:13:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:16,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:13:16,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:13:16,600 INFO L87 Difference]: Start difference. First operand 245 states and 268 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:16,665 INFO L93 Difference]: Finished difference Result 269 states and 292 transitions. [2024-11-27 20:13:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:13:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-27 20:13:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:16,668 INFO L225 Difference]: With dead ends: 269 [2024-11-27 20:13:16,668 INFO L226 Difference]: Without dead ends: 269 [2024-11-27 20:13:16,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:13:16,669 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:16,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 932 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-27 20:13:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-27 20:13:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 264 states have internal predecessors, (288), 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-27 20:13:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 292 transitions. [2024-11-27 20:13:16,678 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 292 transitions. Word has length 40 [2024-11-27 20:13:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:16,678 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 292 transitions. [2024-11-27 20:13:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 292 transitions. [2024-11-27 20:13:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-27 20:13:16,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:16,679 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:16,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:13:16,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 20:13:16,880 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-27 20:13:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash -556500219, now seen corresponding path program 3 times [2024-11-27 20:13:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:16,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057570810] [2024-11-27 20:13:16,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:13:16,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:16,998 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-27 20:13:16,998 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:18,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:18,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057570810] [2024-11-27 20:13:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057570810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404189792] [2024-11-27 20:13:18,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:13:18,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:18,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:18,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:18,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:13:19,273 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-27 20:13:19,274 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:19,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-27 20:13:19,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:19,297 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-27 20:13:19,303 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-27 20:13:19,307 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-27 20:13:19,351 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-27 20:13:19,355 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-27 20:13:19,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:19,546 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-27 20:13:19,560 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-27 20:13:19,748 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:19,748 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-27 20:13:19,755 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-27 20:13:19,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:19,940 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-27 20:13:19,946 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-27 20:13:20,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:20,143 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-27 20:13:20,152 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-27 20:13:20,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:20,344 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-27 20:13:20,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-27 20:13:20,446 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-27 20:13:20,454 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-27 20:13:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:20,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:20,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_551) c_create_data_~data~0.base) .cse1)))))) is different from false [2024-11-27 20:13:20,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_551) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-27 20:13:20,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_551) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-27 20:13:20,830 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_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_549) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_548) c_create_data_~data~0.base) .cse0) v_ArrVal_550) c_create_data_~data~0.base) .cse0) .cse1 8))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_548))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_549) .cse2 v_ArrVal_550) c_create_data_~data~0.base) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_551) c_create_data_~data~0.base) .cse0)))))))) is different from false [2024-11-27 20:13:20,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_548))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_549) .cse2 v_ArrVal_550) c_create_data_~data~0.base) .cse3) 12) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_551) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_549) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_548) c_create_data_~data~0.base) .cse3) v_ArrVal_550) c_create_data_~data~0.base) .cse3) 8)))))) is different from false [2024-11-27 20:13:21,085 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_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_547))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_546) .cse0 v_ArrVal_549) (select (select (store .cse1 .cse0 v_ArrVal_548) c_create_data_~data~0.base) .cse2) v_ArrVal_550))) c_create_data_~data~0.base) .cse2) .cse3 12))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_547))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_548))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_546) .cse4 v_ArrVal_549) .cse5 v_ArrVal_550) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_551) c_create_data_~data~0.base) .cse2)))))))))) is different from false [2024-11-27 20:13:21,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_547))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_548))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_546) .cse1 v_ArrVal_549) .cse2 v_ArrVal_550) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_551) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_547))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_546) .cse7 v_ArrVal_549) (select (select (store .cse8 .cse7 v_ArrVal_548) c_create_data_~data~0.base) .cse3) v_ArrVal_550))) c_create_data_~data~0.base) .cse3) 16 .cse4)))))) is different from false [2024-11-27 20:13:21,542 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_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_545))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_547))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_548))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (<= (+ .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_544) .cse1 v_ArrVal_546) .cse2 v_ArrVal_549) .cse3 v_ArrVal_550) c_create_data_~data~0.base) .cse4) 20) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_551) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_545))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_547))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_544) .cse8 v_ArrVal_546) .cse9 v_ArrVal_549) (select (select (store .cse10 .cse9 v_ArrVal_548) c_create_data_~data~0.base) .cse4) v_ArrVal_550))))) c_create_data_~data~0.base) .cse4)))))) is different from false [2024-11-27 20:13:21,632 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse6 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_547))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse1 v_ArrVal_546) .cse2 v_ArrVal_549) (select (select (store .cse3 .cse2 v_ArrVal_548) c_create_data_~data~0.base) .cse4) v_ArrVal_550))))) c_create_data_~data~0.base) .cse4) 16 .cse6))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_547))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_548))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse7 v_ArrVal_546) .cse8 v_ArrVal_549) .cse9 v_ArrVal_550) c_create_data_~data~0.base) .cse4) .cse6 20) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_551) c_create_data_~data~0.base) .cse4))))))))))))) is different from false [2024-11-27 20:13:21,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4)) (.cse5 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_547))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_548))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse1 v_ArrVal_546) .cse2 v_ArrVal_549) .cse3 v_ArrVal_550) c_create_data_~data~0.base) .cse4) .cse5 24) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_551) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_547))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse9 v_ArrVal_546) .cse10 v_ArrVal_549) (select (select (store .cse11 .cse10 v_ArrVal_548) c_create_data_~data~0.base) .cse4) v_ArrVal_550))))) c_create_data_~data~0.base) .cse4) .cse5 20)))))) is different from false [2024-11-27 20:13:21,749 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_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_542))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_545))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_547))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_548))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_543) .cse1 v_ArrVal_544) .cse2 v_ArrVal_546) .cse3 v_ArrVal_549) .cse4 v_ArrVal_550) c_create_data_~data~0.base) .cse5) 24) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_551) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_542))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_545))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_547))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_543) .cse10 v_ArrVal_544) .cse11 v_ArrVal_546) .cse12 v_ArrVal_549) (select (select (store .cse13 .cse12 v_ArrVal_548) c_create_data_~data~0.base) .cse5) v_ArrVal_550))))))) c_create_data_~data~0.base) .cse5) 20))))) is different from false [2024-11-27 20:13:21,843 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$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_542))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_545))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_547))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_543) .cse1 v_ArrVal_544) .cse2 v_ArrVal_546) .cse3 v_ArrVal_549) (select (select (store .cse4 .cse3 v_ArrVal_548) c_create_data_~data~0.base) .cse5) v_ArrVal_550))))))) c_create_data_~data~0.base) .cse5) .cse8 20))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_542))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_545))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_547))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_548))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_543) .cse9 v_ArrVal_544) .cse10 v_ArrVal_546) .cse11 v_ArrVal_549) .cse12 v_ArrVal_550) c_create_data_~data~0.base) .cse5) .cse8 24) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_551) c_create_data_~data~0.base) .cse5))))))))))))))) is different from false [2024-11-27 20:13:21,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_542))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_545))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_547))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_548))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_543) .cse1 v_ArrVal_544) .cse2 v_ArrVal_546) .cse3 v_ArrVal_549) .cse4 v_ArrVal_550) c_create_data_~data~0.base) .cse5) 24) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_551) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_542))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_545))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_547))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_543) .cse10 v_ArrVal_544) .cse11 v_ArrVal_546) .cse12 v_ArrVal_549) (select (select (store .cse13 .cse12 v_ArrVal_548) c_create_data_~data~0.base) .cse5) v_ArrVal_550))))))) c_create_data_~data~0.base) .cse5) 20)))))) is different from false [2024-11-27 20:13:21,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:21,930 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 705 treesize of output 706 [2024-11-27 20:13:21,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:13:21,942 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 695 treesize of output 396 [2024-11-27 20:13:23,438 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 14674979576 treesize of output 13664367554 [2024-11-27 20:19:53,988 WARN L286 SmtUtils]: Spent 6.51m on a formula simplification. DAG size of input: 18464 DAG size of output: 603 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:19:55,783 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 4800105 treesize of output 4768299 [2024-11-27 20:19:59,429 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 33196 treesize of output 32284 [2024-11-27 20:19:59,658 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 32284 treesize of output 28540 [2024-11-27 20:19:59,884 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 28540 treesize of output 26396 [2024-11-27 20:20:00,117 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 26396 treesize of output 25388 [2024-11-27 20:20:00,414 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 25388 treesize of output 24752 [2024-11-27 20:20:00,645 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 24752 treesize of output 21504 [2024-11-27 20:20:00,924 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 21504 treesize of output 20912 [2024-11-27 20:20:01,240 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 20912 treesize of output 17876 [2024-11-27 20:20:01,515 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 17876 treesize of output 17476 [2024-11-27 20:20:01,823 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 17476 treesize of output 17284 [2024-11-27 20:20:02,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:20:02,479 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 354 treesize of output 355 [2024-11-27 20:20:02,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:20:02,491 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 344 treesize of output 205 [2024-11-27 20:20:02,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:20:02,506 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 18168 treesize of output 12774 [2024-11-27 20:20:02,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:20:02,551 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-27 20:20:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 67 not checked. [2024-11-27 20:20:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404189792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:20:02,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:20:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 20] total 50 [2024-11-27 20:20:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048553000] [2024-11-27 20:20:02,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:20:02,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-27 20:20:02,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:02,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-27 20:20:02,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1196, Unknown=26, NotChecked=1092, Total=2550 [2024-11-27 20:20:02,626 INFO L87 Difference]: Start difference. First operand 269 states and 292 transitions. Second operand has 51 states, 50 states have (on average 2.12) internal successors, (106), 51 states have internal predecessors, (106), 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-27 20:20:11,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_551) c_create_data_~data~0.base) .cse2)))) (<= 0 (+ .cse3 .cse0 4)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_548))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (<= (+ 16 .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_549) .cse4 v_ArrVal_550) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_551) c_create_data_~data~0.base) .cse2)))))) (<= (+ .cse3 .cse0 8) (select |c_#length| .cse1)) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_549) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_548) c_create_data_~data~0.base) .cse2) v_ArrVal_550) c_create_data_~data~0.base) .cse2) 12)))))) is different from false [2024-11-27 20:20:12,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse1 (* c_create_data_~counter~0 4))) (and (<= 0 (+ .cse0 .cse1)) (<= (+ .cse0 .cse1 4) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_549) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_548) c_create_data_~data~0.base) .cse2) v_ArrVal_550) c_create_data_~data~0.base) .cse2) .cse1 8))) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse2) 4))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_548))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_549) .cse3 v_ArrVal_550) c_create_data_~data~0.base) .cse2) .cse1 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_551) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_551) c_create_data_~data~0.base) .cse2)))) (<= 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-27 20:20:12,403 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_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_549) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_548) c_create_data_~data~0.base) .cse0) v_ArrVal_550) c_create_data_~data~0.base) .cse0) .cse1 8))) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse0) 4))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_548))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_549) .cse2 v_ArrVal_550) c_create_data_~data~0.base) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_551) c_create_data_~data~0.base) .cse0)))))) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_551) 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-27 20:20:12,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_551) c_create_data_~data~0.base) .cse2)))) (<= 0 (+ .cse3 .cse0 4)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_550) c_create_data_~data~0.base) .cse2)))) (<= (+ .cse3 .cse0 8) (select |c_#length| .cse1))))) is different from false [2024-11-27 20:20:12,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse1 (* c_create_data_~counter~0 4))) (and (<= 0 (+ .cse0 .cse1)) (<= (+ .cse0 .cse1 4) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse2) 4))) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_550) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_551) c_create_data_~data~0.base) .cse2)))) (<= 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-27 20:20:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:20:17,461 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2024-11-27 20:20:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-27 20:20:17,462 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.12) internal successors, (106), 51 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-27 20:20:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:20:17,464 INFO L225 Difference]: With dead ends: 295 [2024-11-27 20:20:17,464 INFO L226 Difference]: Without dead ends: 295 [2024-11-27 20:20:17,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=551, Invalid=2426, Unknown=65, NotChecked=2214, Total=5256 [2024-11-27 20:20:17,468 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 56 mSDsluCounter, 2712 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 17 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 3498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 1727 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:20:17,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2871 Invalid, 3498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1724 Invalid, 30 Unknown, 1727 Unchecked, 6.9s Time] [2024-11-27 20:20:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-27 20:20:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-27 20:20:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 242 states have (on average 1.2975206611570247) internal successors, (314), 290 states have internal predecessors, (314), 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-27 20:20:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 318 transitions. [2024-11-27 20:20:17,479 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 318 transitions. Word has length 43 [2024-11-27 20:20:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:20:17,479 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 318 transitions. [2024-11-27 20:20:17,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.12) internal successors, (106), 51 states have internal predecessors, (106), 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-27 20:20:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 318 transitions. [2024-11-27 20:20:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-27 20:20:17,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:20:17,481 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:17,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:20:17,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-27 20:20:17,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-27 20:20:17,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1624281407, now seen corresponding path program 2 times [2024-11-27 20:20:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:17,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961927417] [2024-11-27 20:20:17,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:20:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:17,717 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:20:17,717 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:20:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-27 20:20:17,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:17,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961927417] [2024-11-27 20:20:17,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961927417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:20:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863983134] [2024-11-27 20:20:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:17,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:20:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:17,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:20:17,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:20:17,822 INFO L87 Difference]: Start difference. First operand 295 states and 318 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-27 20:20:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:20:18,242 INFO L93 Difference]: Finished difference Result 293 states and 314 transitions. [2024-11-27 20:20:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:20:18,243 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 65 [2024-11-27 20:20:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:20:18,245 INFO L225 Difference]: With dead ends: 293 [2024-11-27 20:20:18,245 INFO L226 Difference]: Without dead ends: 293 [2024-11-27 20:20:18,245 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-27 20:20:18,247 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:20:18,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 240 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:20:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-27 20:20:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-27 20:20:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 242 states have (on average 1.28099173553719) internal successors, (310), 288 states have internal predecessors, (310), 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-27 20:20:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 314 transitions. [2024-11-27 20:20:18,256 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 314 transitions. Word has length 65 [2024-11-27 20:20:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:20:18,256 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 314 transitions. [2024-11-27 20:20:18,257 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-27 20:20:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 314 transitions. [2024-11-27 20:20:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 20:20:18,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:20:18,260 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:18,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:20:18,260 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-27 20:20:18,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:18,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2120268523, now seen corresponding path program 4 times [2024-11-27 20:20:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:18,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455496112] [2024-11-27 20:20:18,262 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 20:20:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:18,494 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 20:20:18,494 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:20:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:20:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455496112] [2024-11-27 20:20:24,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455496112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:20:24,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069310008] [2024-11-27 20:20:24,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 20:20:24,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:20:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:20:24,207 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:20:24,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:20:27,696 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 20:20:27,696 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:20:27,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-27 20:20:27,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:20:27,724 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-27 20:20:27,759 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-27 20:20:27,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:20:27,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:20:28,861 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:28,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:28,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:20:29,526 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:29,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:29,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:30,359 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:30,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:30,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:31,033 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:31,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:31,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:31,724 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:31,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:31,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:32,566 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:32,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:32,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:33,444 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:33,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:33,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:34,284 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:34,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:34,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:35,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:35,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:35,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:36,069 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:20:36,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:20:36,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2024-11-27 20:20:36,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-27 20:20:36,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-27 20:20:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:20:36,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:20:37,591 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_813 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_813) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_813) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_812) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-27 20:20:37,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_813) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_812) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_813 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_813) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-27 20:20:38,016 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_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_810) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_811) c_create_data_~data~0.base) .cse0) v_ArrVal_813) c_create_data_~data~0.base) .cse0) .cse1 8))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_811))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_810) .cse2 v_ArrVal_813) c_create_data_~data~0.base) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_812) c_create_data_~data~0.base) .cse0)))))))) is different from false [2024-11-27 20:20:38,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_810) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_811) c_create_data_~data~0.base) .cse1) v_ArrVal_813) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_811))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_810) .cse3 v_ArrVal_813) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_812) c_create_data_~data~0.base) .cse1))))))))) is different from false [2024-11-27 20:20:38,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_811))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_810) .cse1 v_ArrVal_813) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_812) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_810) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_811) c_create_data_~data~0.base) .cse2) v_ArrVal_813) c_create_data_~data~0.base) .cse2) .cse3 12)))))) is different from false [2024-11-27 20:20:38,186 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_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_809))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_811))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_808) .cse0 v_ArrVal_810) .cse1 v_ArrVal_813) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_812) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_809))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_808) .cse6 v_ArrVal_810) (select (select (store .cse7 .cse6 v_ArrVal_811) c_create_data_~data~0.base) .cse2) v_ArrVal_813))) c_create_data_~data~0.base) .cse2) .cse3 12))))) is different from false [2024-11-27 20:20:38,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_809))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_811))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_808) .cse1 v_ArrVal_810) .cse2 v_ArrVal_813) c_create_data_~data~0.base) .cse3) 16 .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_812) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_809))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_808) .cse7 v_ArrVal_810) (select (select (store .cse8 .cse7 v_ArrVal_811) c_create_data_~data~0.base) .cse3) v_ArrVal_813))) c_create_data_~data~0.base) .cse3) .cse4 12)))))) is different from false [2024-11-27 20:20:38,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_809))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_811))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_808) .cse1 v_ArrVal_810) .cse2 v_ArrVal_813) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_812) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_809))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_808) .cse7 v_ArrVal_810) (select (select (store .cse8 .cse7 v_ArrVal_811) c_create_data_~data~0.base) .cse3) v_ArrVal_813))) c_create_data_~data~0.base) .cse3) 16 .cse4)))))) is different from false [2024-11-27 20:20:38,335 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_807))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_809))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_806) .cse0 v_ArrVal_808) .cse1 v_ArrVal_810) (select (select (store .cse2 .cse1 v_ArrVal_811) c_create_data_~data~0.base) .cse3) v_ArrVal_813))))) c_create_data_~data~0.base) .cse3) 16 .cse5))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_807))) (let ((.cse6 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_809))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_811))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_806) .cse6 v_ArrVal_808) .cse7 v_ArrVal_810) .cse8 v_ArrVal_813) c_create_data_~data~0.base) .cse3) .cse5 20) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_812) c_create_data_~data~0.base) .cse3)))))))))))) is different from false [2024-11-27 20:20:38,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse6 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_807))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_809))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_806) .cse1 v_ArrVal_808) .cse2 v_ArrVal_810) (select (select (store .cse3 .cse2 v_ArrVal_811) c_create_data_~data~0.base) .cse4) v_ArrVal_813))))) c_create_data_~data~0.base) .cse4) 16 .cse6))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_807))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_809))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_811))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_806) .cse7 v_ArrVal_808) .cse8 v_ArrVal_810) .cse9 v_ArrVal_813) c_create_data_~data~0.base) .cse4) .cse6 20) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_812) c_create_data_~data~0.base) .cse4))))))))))))) is different from false [2024-11-27 20:20:39,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_create_data_~counter~0 4)) (.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_805))) (let ((.cse0 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_807))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_809))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_804) .cse0 v_ArrVal_806) .cse1 v_ArrVal_808) .cse2 v_ArrVal_810) (select (select (store .cse3 .cse2 v_ArrVal_811) c_create_data_~data~0.base) .cse4) v_ArrVal_813))))))) c_create_data_~data~0.base) .cse4) .cse7 20))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_805))) (let ((.cse8 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_807))) (let ((.cse9 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_809))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_811))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_804) .cse8 v_ArrVal_806) .cse9 v_ArrVal_808) .cse10 v_ArrVal_810) .cse11 v_ArrVal_813) c_create_data_~data~0.base) .cse4) .cse7 24) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_812) c_create_data_~data~0.base) .cse4)))))))))))))) is different from false [2024-11-27 20:20:40,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_805))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_807))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_809))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_804) .cse2 v_ArrVal_806) .cse3 v_ArrVal_808) .cse4 v_ArrVal_810) (select (select (store .cse5 .cse4 v_ArrVal_811) c_create_data_~data~0.base) .cse6) v_ArrVal_813))))))) c_create_data_~data~0.base) .cse6) 24))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_805))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_807))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_809))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_811))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (<= (+ .cse0 28 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_804) .cse9 v_ArrVal_806) .cse10 v_ArrVal_808) .cse11 v_ArrVal_810) .cse12 v_ArrVal_813) c_create_data_~data~0.base) .cse6)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_812) c_create_data_~data~0.base) .cse6))))))))))))))) is different from false [2024-11-27 20:20:40,699 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_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_803))) (let ((.cse0 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_805))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_807))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_809))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_802) .cse0 v_ArrVal_804) .cse1 v_ArrVal_806) .cse2 v_ArrVal_808) .cse3 v_ArrVal_810) (select (select (store .cse4 .cse3 v_ArrVal_811) c_create_data_~data~0.base) .cse5) v_ArrVal_813))))))))) c_create_data_~data~0.base) .cse5) .cse9 24))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_803))) (let ((.cse10 (select (select .cse19 c_create_data_~data~0.base) .cse5))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_805))) (let ((.cse11 (select (select .cse18 c_create_data_~data~0.base) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_807))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_809))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_811))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_802) .cse10 v_ArrVal_804) .cse11 v_ArrVal_806) .cse12 v_ArrVal_808) .cse13 v_ArrVal_810) .cse14 v_ArrVal_813) c_create_data_~data~0.base) .cse5) .cse9 28) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_812) c_create_data_~data~0.base) .cse5)))))))))))))))) is different from false [2024-11-27 20:20:40,864 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse10 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_803))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_805))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_807))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_809))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_802) .cse1 v_ArrVal_804) .cse2 v_ArrVal_806) .cse3 v_ArrVal_808) .cse4 v_ArrVal_810) (select (select (store .cse5 .cse4 v_ArrVal_811) c_create_data_~data~0.base) .cse6) v_ArrVal_813))))))))) c_create_data_~data~0.base) .cse6) .cse10 24))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_803))) (let ((.cse11 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_805))) (let ((.cse12 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_807))) (let ((.cse13 (select (select .cse18 c_create_data_~data~0.base) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_809))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_811))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_802) .cse11 v_ArrVal_804) .cse12 v_ArrVal_806) .cse13 v_ArrVal_808) .cse14 v_ArrVal_810) .cse15 v_ArrVal_813) c_create_data_~data~0.base) .cse6) .cse10 28) (select |c_#length| (select (select (store .cse16 .cse15 v_ArrVal_812) c_create_data_~data~0.base) .cse6))))))))))))))))) is different from false [2024-11-27 20:20:41,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse6)) (.cse7 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_803))) (let ((.cse1 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_805))) (let ((.cse2 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_807))) (let ((.cse3 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_809))) (let ((.cse4 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_811))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_802) .cse1 v_ArrVal_804) .cse2 v_ArrVal_806) .cse3 v_ArrVal_808) .cse4 v_ArrVal_810) .cse5 v_ArrVal_813) c_create_data_~data~0.base) .cse6) 32 .cse7) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_812) c_create_data_~data~0.base) .cse6)))))))))))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_803))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_805))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_807))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_809))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_802) .cse13 v_ArrVal_804) .cse14 v_ArrVal_806) .cse15 v_ArrVal_808) .cse16 v_ArrVal_810) (select (select (store .cse17 .cse16 v_ArrVal_811) c_create_data_~data~0.base) .cse6) v_ArrVal_813))))))))) c_create_data_~data~0.base) .cse6) .cse7 28)))))) is different from false [2024-11-27 20:20:45,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse7 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_800))) (let ((.cse1 (select (select .cse13 c_create_data_~data~0.base) .cse7))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_803))) (let ((.cse2 (select (select .cse12 c_create_data_~data~0.base) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_805))) (let ((.cse3 (select (select .cse11 c_create_data_~data~0.base) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_807))) (let ((.cse4 (select (select .cse10 c_create_data_~data~0.base) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_809))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_811))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (<= (+ 32 .cse0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_801) .cse1 v_ArrVal_802) .cse2 v_ArrVal_804) .cse3 v_ArrVal_806) .cse4 v_ArrVal_808) .cse5 v_ArrVal_810) .cse6 v_ArrVal_813) c_create_data_~data~0.base) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_812) c_create_data_~data~0.base) .cse7)))))))))))))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ .cse0 28 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_800))) (let ((.cse14 (select (select .cse23 c_create_data_~data~0.base) .cse7))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_803))) (let ((.cse15 (select (select .cse22 c_create_data_~data~0.base) .cse7))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_805))) (let ((.cse16 (select (select .cse21 c_create_data_~data~0.base) .cse7))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_807))) (let ((.cse17 (select (select .cse20 c_create_data_~data~0.base) .cse7))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_809))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_801) .cse14 v_ArrVal_802) .cse15 v_ArrVal_804) .cse16 v_ArrVal_806) .cse17 v_ArrVal_808) .cse18 v_ArrVal_810) (select (select (store .cse19 .cse18 v_ArrVal_811) c_create_data_~data~0.base) .cse7) v_ArrVal_813))))))))))) c_create_data_~data~0.base) .cse7)))))) is different from false [2024-11-27 20:20:49,477 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$#1.base| c_create_data_~data~0.base) .cse8))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_800))) (let ((.cse2 (select (select .cse14 c_create_data_~data~0.base) .cse8))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_803))) (let ((.cse3 (select (select .cse13 c_create_data_~data~0.base) .cse8))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_805))) (let ((.cse4 (select (select .cse12 c_create_data_~data~0.base) .cse8))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_807))) (let ((.cse5 (select (select .cse11 c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_809))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_811))) (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$#1.offset| .cse1 v_ArrVal_801) .cse2 v_ArrVal_802) .cse3 v_ArrVal_804) .cse4 v_ArrVal_806) .cse5 v_ArrVal_808) .cse6 v_ArrVal_810) .cse7 v_ArrVal_813) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_812) c_create_data_~data~0.base) .cse8)))))))))))))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_800))) (let ((.cse15 (select (select .cse24 c_create_data_~data~0.base) .cse8))) (let ((.cse23 (store .cse24 .cse15 v_ArrVal_803))) (let ((.cse16 (select (select .cse23 c_create_data_~data~0.base) .cse8))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_805))) (let ((.cse17 (select (select .cse22 c_create_data_~data~0.base) .cse8))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_807))) (let ((.cse18 (select (select .cse21 c_create_data_~data~0.base) .cse8))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_809))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse8))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_801) .cse15 v_ArrVal_802) .cse16 v_ArrVal_804) .cse17 v_ArrVal_806) .cse18 v_ArrVal_808) .cse19 v_ArrVal_810) (select (select (store .cse20 .cse19 v_ArrVal_811) c_create_data_~data~0.base) .cse8) v_ArrVal_813))))))))))) c_create_data_~data~0.base) .cse8) 28)))))) is different from false [2024-11-27 20:20:53,978 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$#1.base| c_create_data_~data~0.base) .cse8))) (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_800))) (let ((.cse2 (select (select .cse14 c_create_data_~data~0.base) .cse8))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_803))) (let ((.cse3 (select (select .cse13 c_create_data_~data~0.base) .cse8))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_805))) (let ((.cse4 (select (select .cse12 c_create_data_~data~0.base) .cse8))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_807))) (let ((.cse5 (select (select .cse11 c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_809))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_811))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (<= (+ .cse0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_801) .cse2 v_ArrVal_802) .cse3 v_ArrVal_804) .cse4 v_ArrVal_806) .cse5 v_ArrVal_808) .cse6 v_ArrVal_810) .cse7 v_ArrVal_813) c_create_data_~data~0.base) .cse8) 36) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_812) c_create_data_~data~0.base) .cse8)))))))))))))))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= 0 (+ 32 .cse0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_800))) (let ((.cse15 (select (select .cse24 c_create_data_~data~0.base) .cse8))) (let ((.cse23 (store .cse24 .cse15 v_ArrVal_803))) (let ((.cse16 (select (select .cse23 c_create_data_~data~0.base) .cse8))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_805))) (let ((.cse17 (select (select .cse22 c_create_data_~data~0.base) .cse8))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_807))) (let ((.cse18 (select (select .cse21 c_create_data_~data~0.base) .cse8))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_809))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse8))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_801) .cse15 v_ArrVal_802) .cse16 v_ArrVal_804) .cse17 v_ArrVal_806) .cse18 v_ArrVal_808) .cse19 v_ArrVal_810) (select (select (store .cse20 .cse19 v_ArrVal_811) c_create_data_~data~0.base) .cse8) v_ArrVal_813))))))))))) c_create_data_~data~0.base) .cse8))))))) is different from false [2024-11-27 20:20:57,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-27 20:20:57,781 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-27 20:20:57,782 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-27 20:20:57,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:20:57,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:20:57,983 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-27 20:20:57,991 INFO L158 Benchmark]: Toolchain (without parser) took 476915.21ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 104.6MB in the beginning and 658.8MB in the end (delta: -554.2MB). Peak memory consumption was 917.3MB. Max. memory is 16.1GB. [2024-11-27 20:20:57,992 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:20:57,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 86.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:20:57,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.68ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:20:57,996 INFO L158 Benchmark]: Boogie Preprocessor took 84.74ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 81.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:20:57,996 INFO L158 Benchmark]: RCFGBuilder took 910.48ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 46.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-27 20:20:57,997 INFO L158 Benchmark]: TraceAbstraction took 475273.84ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 46.0MB in the beginning and 658.8MB in the end (delta: -612.9MB). Peak memory consumption was 858.5MB. Max. memory is 16.1GB. [2024-11-27 20:20:57,999 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 86.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.68ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.74ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 81.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 910.48ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 46.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 475273.84ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 46.0MB in the beginning and 658.8MB in the end (delta: -612.9MB). Peak memory consumption was 858.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/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_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB --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-d790fec [2024-11-27 20:21:00,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:21:00,901 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:21:00,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:21:00,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:21:00,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:21:00,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:21:00,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:21:00,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:21:00,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:21:00,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:21:00,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:21:00,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:21:00,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:21:00,941 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:21:00,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:21:00,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:21:00,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:21:00,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:21:00,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:21:00,942 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:21:00,942 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:21:00,942 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:21:00,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:21:00,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:21:00,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:21:00,943 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:21:00,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:21:00,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:21:00,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:21:00,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:21:00,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:21:00,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:21:00,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:21:00,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:21:00,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:21:00,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:21:00,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:21:00,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:21:00,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:21:00,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:21:00,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:21:00,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:21:00,945 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:21:00,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:21:00,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:21:00,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:21:00,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:21:00,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:21:00,946 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_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB 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-27 20:21:01,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:21:01,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:21:01,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:21:01,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:21:01,368 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:21:01,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-27 20:21:04,886 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/932635026/ae30b9f54a32477cb4cc9ab70f87b0b8/FLAG5f6ae98ce [2024-11-27 20:21:05,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:21:05,165 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-27 20:21:05,178 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/932635026/ae30b9f54a32477cb4cc9ab70f87b0b8/FLAG5f6ae98ce [2024-11-27 20:21:05,195 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/data/932635026/ae30b9f54a32477cb4cc9ab70f87b0b8 [2024-11-27 20:21:05,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:21:05,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:21:05,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:21:05,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:21:05,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:21:05,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fa3d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05, skipping insertion in model container [2024-11-27 20:21:05,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:21:05,598 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-27 20:21:05,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:21:05,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:21:05,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:21:05,743 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:21:05,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05 WrapperNode [2024-11-27 20:21:05,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:21:05,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:21:05,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:21:05,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:21:05,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,811 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-27 20:21:05,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:21:05,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:21:05,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:21:05,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:21:05,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,877 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2024-11-27 20:21:05,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:21:05,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:21:05,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:21:05,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:21:05,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (1/1) ... [2024-11-27 20:21:05,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:21:05,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:05,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:21:05,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:21:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:21:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-27 20:21:06,013 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:21:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:21:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:21:06,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:21:06,197 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:21:06,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:21:07,182 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-27 20:21:07,182 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:21:07,202 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:21:07,202 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-27 20:21:07,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:21:07 BoogieIcfgContainer [2024-11-27 20:21:07,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:21:07,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:21:07,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:21:07,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:21:07,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:21:05" (1/3) ... [2024-11-27 20:21:07,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a6b198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:21:07, skipping insertion in model container [2024-11-27 20:21:07,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:05" (2/3) ... [2024-11-27 20:21:07,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a6b198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:21:07, skipping insertion in model container [2024-11-27 20:21:07,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:21:07" (3/3) ... [2024-11-27 20:21:07,220 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-27 20:21:07,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:21:07,239 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-27 20:21:07,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:21:07,341 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;@605612ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:21:07,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-27 20:21:07,345 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-27 20:21:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 20:21:07,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:07,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 20:21:07,354 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-27 20:21:07,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash 4929960, now seen corresponding path program 1 times [2024-11-27 20:21:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:07,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892391326] [2024-11-27 20:21:07,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:07,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:07,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:07,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:07,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:21:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:07,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:21:07,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:07,481 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-27 20:21:07,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:07,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892391326] [2024-11-27 20:21:07,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892391326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:07,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:07,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:21:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947660749] [2024-11-27 20:21:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:07,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:21:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:07,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:21:07,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:21:07,514 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-27 20:21:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:07,540 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-11-27 20:21:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:21:07,542 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-27 20:21:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:07,549 INFO L225 Difference]: With dead ends: 193 [2024-11-27 20:21:07,549 INFO L226 Difference]: Without dead ends: 191 [2024-11-27 20:21:07,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 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-27 20:21:07,554 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-27 20:21:07,554 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-27 20:21:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-27 20:21:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-27 20:21:07,606 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-27 20:21:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2024-11-27 20:21:07,617 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 4 [2024-11-27 20:21:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:07,618 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2024-11-27 20:21:07,618 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-27 20:21:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2024-11-27 20:21:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 20:21:07,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:07,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 20:21:07,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:07,823 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-27 20:21:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash 4927557, now seen corresponding path program 1 times [2024-11-27 20:21:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157080433] [2024-11-27 20:21:07,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:07,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:07,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:07,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:07,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:21:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:07,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 20:21:07,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:07,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:21:08,048 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 20:21:08,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 20:21:08,070 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-27 20:21:08,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:08,071 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157080433] [2024-11-27 20:21:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157080433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:08,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191381451] [2024-11-27 20:21:08,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:21:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:08,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:21:08,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:21:08,076 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-27 20:21:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:08,733 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2024-11-27 20:21:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:21:08,733 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-27 20:21:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:08,735 INFO L225 Difference]: With dead ends: 185 [2024-11-27 20:21:08,735 INFO L226 Difference]: Without dead ends: 185 [2024-11-27 20:21:08,735 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-27 20:21:08,736 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:08,736 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.6s Time] [2024-11-27 20:21:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-27 20:21:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-27 20:21:08,745 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-27 20:21:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2024-11-27 20:21:08,748 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2024-11-27 20:21:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2024-11-27 20:21:08,749 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-27 20:21:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2024-11-27 20:21:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 20:21:08,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:08,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 20:21:08,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:08,953 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-27 20:21:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash 4927558, now seen corresponding path program 1 times [2024-11-27 20:21:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411806226] [2024-11-27 20:21:08,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:08,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:08,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:08,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:08,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:21:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:09,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 20:21:09,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:09,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:21:09,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:21:09,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:21:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 20:21:09,133 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:21:09,134 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 13 treesize of output 13 [2024-11-27 20:21:09,154 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-27 20:21:09,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:09,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411806226] [2024-11-27 20:21:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411806226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131265447] [2024-11-27 20:21:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:09,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:21:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:09,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:21:09,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:21:09,156 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-27 20:21:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:10,051 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2024-11-27 20:21:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:21:10,053 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-27 20:21:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:10,055 INFO L225 Difference]: With dead ends: 201 [2024-11-27 20:21:10,055 INFO L226 Difference]: Without dead ends: 201 [2024-11-27 20:21:10,056 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-27 20:21:10,056 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:10,057 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.8s Time] [2024-11-27 20:21:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-27 20:21:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-27 20:21:10,067 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-27 20:21:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-11-27 20:21:10,070 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2024-11-27 20:21:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:10,070 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-11-27 20:21:10,070 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-27 20:21:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-11-27 20:21:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 20:21:10,071 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:10,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:21:10,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:21:10,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:10,272 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-27 20:21:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 152754377, now seen corresponding path program 1 times [2024-11-27 20:21:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358994921] [2024-11-27 20:21:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:10,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:10,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:10,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:10,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:21:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:10,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:21:10,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:10,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:21:10,364 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-27 20:21:10,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:10,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:10,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358994921] [2024-11-27 20:21:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358994921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:10,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:10,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:21:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873402941] [2024-11-27 20:21:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:10,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:10,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:10,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:10,366 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-27 20:21:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:10,690 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2024-11-27 20:21:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:10,691 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-27 20:21:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:10,692 INFO L225 Difference]: With dead ends: 188 [2024-11-27 20:21:10,692 INFO L226 Difference]: Without dead ends: 188 [2024-11-27 20:21:10,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-27 20:21:10,693 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:10,694 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.3s Time] [2024-11-27 20:21:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-27 20:21:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-27 20:21:10,701 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-27 20:21:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2024-11-27 20:21:10,703 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2024-11-27 20:21:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2024-11-27 20:21:10,704 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-27 20:21:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2024-11-27 20:21:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 20:21:10,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:10,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:21:10,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:21:10,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:10,905 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-27 20:21:10,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash 152754378, now seen corresponding path program 1 times [2024-11-27 20:21:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441014718] [2024-11-27 20:21:10,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:10,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:10,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:10,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:10,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:21:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:10,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:21:10,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:10,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:21:11,019 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-27 20:21:11,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:11,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441014718] [2024-11-27 20:21:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441014718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:11,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:11,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:21:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030193143] [2024-11-27 20:21:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:11,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:11,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:11,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:11,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:11,021 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-27 20:21:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:11,402 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2024-11-27 20:21:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:11,402 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-27 20:21:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:11,403 INFO L225 Difference]: With dead ends: 186 [2024-11-27 20:21:11,404 INFO L226 Difference]: Without dead ends: 186 [2024-11-27 20:21:11,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-27 20:21:11,404 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:11,405 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.4s Time] [2024-11-27 20:21:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-27 20:21:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-27 20:21:11,421 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-27 20:21:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2024-11-27 20:21:11,423 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2024-11-27 20:21:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:11,424 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2024-11-27 20:21:11,424 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-27 20:21:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2024-11-27 20:21:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 20:21:11,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:11,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:11,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 20:21:11,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:11,625 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-27 20:21:11,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1957144585, now seen corresponding path program 1 times [2024-11-27 20:21:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352577833] [2024-11-27 20:21:11,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:11,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:11,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:11,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:21:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:11,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:21:11,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:11,830 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-27 20:21:11,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:11,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352577833] [2024-11-27 20:21:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352577833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:21:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508097569] [2024-11-27 20:21:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:21:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:11,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:21:11,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:21:11,834 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-27 20:21:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:12,095 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-11-27 20:21:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:21:12,096 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-27 20:21:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:12,097 INFO L225 Difference]: With dead ends: 195 [2024-11-27 20:21:12,097 INFO L226 Difference]: Without dead ends: 195 [2024-11-27 20:21:12,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-27 20:21:12,098 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:12,098 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.2s Time] [2024-11-27 20:21:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-27 20:21:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-11-27 20:21:12,112 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-27 20:21:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-27 20:21:12,120 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2024-11-27 20:21:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:12,120 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-27 20:21:12,120 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-27 20:21:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-27 20:21:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 20:21:12,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:12,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:12,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:21:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:12,322 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-27 20:21:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 376655322, now seen corresponding path program 1 times [2024-11-27 20:21:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311188810] [2024-11-27 20:21:12,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:12,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:12,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:21:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:12,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:21:12,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:12,451 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-27 20:21:12,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:12,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311188810] [2024-11-27 20:21:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311188810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:21:12,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260510270] [2024-11-27 20:21:12,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:21:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:12,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:21:12,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:21:12,453 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-27 20:21:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:12,500 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2024-11-27 20:21:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:21:12,500 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-27 20:21:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:12,502 INFO L225 Difference]: With dead ends: 266 [2024-11-27 20:21:12,502 INFO L226 Difference]: Without dead ends: 266 [2024-11-27 20:21:12,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-27 20:21:12,503 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-27 20:21:12,503 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-27 20:21:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-27 20:21:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2024-11-27 20:21:12,510 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-27 20:21:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2024-11-27 20:21:12,512 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2024-11-27 20:21:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:12,512 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2024-11-27 20:21:12,512 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-27 20:21:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2024-11-27 20:21:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:21:12,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:12,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:12,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 20:21:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:12,713 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-27 20:21:12,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580717, now seen corresponding path program 1 times [2024-11-27 20:21:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:12,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53179123] [2024-11-27 20:21:12,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:12,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:12,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:12,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:12,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:21:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:12,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:21:12,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:12,840 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2024-11-27 20:21:12,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2024-11-27 20:21:12,859 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-27 20:21:12,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:12,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53179123] [2024-11-27 20:21:12,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53179123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:12,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:12,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:21:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308769300] [2024-11-27 20:21:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:12,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:12,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:12,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:12,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:12,861 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-27 20:21:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:13,220 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2024-11-27 20:21:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:13,220 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-27 20:21:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:13,222 INFO L225 Difference]: With dead ends: 215 [2024-11-27 20:21:13,222 INFO L226 Difference]: Without dead ends: 215 [2024-11-27 20:21:13,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-27 20:21:13,223 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:13,223 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.3s Time] [2024-11-27 20:21:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-27 20:21:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-27 20:21:13,229 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-27 20:21:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2024-11-27 20:21:13,230 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2024-11-27 20:21:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:13,231 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2024-11-27 20:21:13,231 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-27 20:21:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2024-11-27 20:21:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:21:13,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:13,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:13,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:21:13,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:13,432 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-27 20:21:13,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580716, now seen corresponding path program 1 times [2024-11-27 20:21:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:13,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008603501] [2024-11-27 20:21:13,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:13,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:13,434 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:13,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:21:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:13,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:21:13,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:13,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:21:13,547 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 11 treesize of output 5 [2024-11-27 20:21:13,557 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-27 20:21:13,569 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-27 20:21:13,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:13,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008603501] [2024-11-27 20:21:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008603501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:13,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:13,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:21:13,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769558497] [2024-11-27 20:21:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:13,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:13,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:13,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:13,571 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-27 20:21:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:14,031 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-11-27 20:21:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:14,032 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-27 20:21:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:14,033 INFO L225 Difference]: With dead ends: 200 [2024-11-27 20:21:14,033 INFO L226 Difference]: Without dead ends: 200 [2024-11-27 20:21:14,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-27 20:21:14,034 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:14,034 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.4s Time] [2024-11-27 20:21:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-27 20:21:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-27 20:21:14,041 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-27 20:21:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2024-11-27 20:21:14,043 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2024-11-27 20:21:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:14,043 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2024-11-27 20:21:14,043 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-27 20:21:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2024-11-27 20:21:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 20:21:14,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:14,044 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-27 20:21:14,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:14,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:14,245 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-27 20:21:14,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461590, now seen corresponding path program 1 times [2024-11-27 20:21:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090808018] [2024-11-27 20:21:14,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:14,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:14,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:14,250 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:14,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:21:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:14,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 20:21:14,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:14,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:21:14,386 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 11 treesize of output 7 [2024-11-27 20:21:14,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:21:14,448 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 23 treesize of output 11 [2024-11-27 20:21:14,465 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-27 20:21:14,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:14,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090808018] [2024-11-27 20:21:14,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090808018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:14,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:14,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:21:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061603685] [2024-11-27 20:21:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:14,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:21:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:14,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:21:14,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:21:14,467 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-27 20:21:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:15,254 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2024-11-27 20:21:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:21:15,255 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-27 20:21:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:15,257 INFO L225 Difference]: With dead ends: 253 [2024-11-27 20:21:15,257 INFO L226 Difference]: Without dead ends: 253 [2024-11-27 20:21:15,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-27 20:21:15,258 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:15,258 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.8s Time] [2024-11-27 20:21:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-27 20:21:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2024-11-27 20:21:15,268 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-27 20:21:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2024-11-27 20:21:15,270 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2024-11-27 20:21:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:15,270 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2024-11-27 20:21:15,271 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-27 20:21:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2024-11-27 20:21:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 20:21:15,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:15,272 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-27 20:21:15,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:21:15,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:15,473 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-27 20:21:15,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461589, now seen corresponding path program 1 times [2024-11-27 20:21:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:15,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750098111] [2024-11-27 20:21:15,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:15,476 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:15,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:21:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:15,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 20:21:15,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:15,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:21:15,617 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 11 treesize of output 5 [2024-11-27 20:21:15,661 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-27 20:21:15,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:21:15,760 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 21 treesize of output 9 [2024-11-27 20:21:15,808 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-27 20:21:15,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:15,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:15,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750098111] [2024-11-27 20:21:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750098111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:21:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818754093] [2024-11-27 20:21:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:15,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:21:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:15,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:21:15,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:21:15,810 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-27 20:21:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:16,904 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-11-27 20:21:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:21:16,905 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-27 20:21:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:16,907 INFO L225 Difference]: With dead ends: 208 [2024-11-27 20:21:16,907 INFO L226 Difference]: Without dead ends: 208 [2024-11-27 20:21:16,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-27 20:21:16,908 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:16,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 517 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 20:21:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-27 20:21:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-27 20:21:16,919 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-27 20:21:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2024-11-27 20:21:16,920 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2024-11-27 20:21:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:16,920 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2024-11-27 20:21:16,920 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-27 20:21:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2024-11-27 20:21:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:21:16,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:16,921 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-27 20:21:16,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 20:21:17,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:17,122 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-27 20:21:17,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash 617548676, now seen corresponding path program 1 times [2024-11-27 20:21:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:17,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986788721] [2024-11-27 20:21:17,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:17,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:17,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:17,124 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:17,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:21:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:17,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:21:17,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:17,284 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-27 20:21:17,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-27 20:21:17,343 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-27 20:21:17,510 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:17,510 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 44 treesize of output 43 [2024-11-27 20:21:17,574 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 33 treesize of output 15 [2024-11-27 20:21:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:21:17,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:17,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_158) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))))) is different from false [2024-11-27 20:21:17,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse0) v_ArrVal_158) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-27 20:21:17,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:17,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-27 20:21:17,764 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 44 treesize of output 32 [2024-11-27 20:21:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:21:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-27 20:21:17,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:17,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986788721] [2024-11-27 20:21:17,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986788721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:21:17,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:21:17,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-27 20:21:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137125724] [2024-11-27 20:21:17,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:21:17,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:21:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:17,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:21:17,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2024-11-27 20:21:17,821 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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-27 20:21:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:18,944 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2024-11-27 20:21:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:21:18,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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-27 20:21:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:18,946 INFO L225 Difference]: With dead ends: 209 [2024-11-27 20:21:18,946 INFO L226 Difference]: Without dead ends: 209 [2024-11-27 20:21:18,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2024-11-27 20:21:18,947 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 22 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:18,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 681 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 185 Unchecked, 1.1s Time] [2024-11-27 20:21:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-27 20:21:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-27 20:21:18,954 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-27 20:21:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-11-27 20:21:18,956 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2024-11-27 20:21:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:18,957 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-11-27 20:21:18,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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-27 20:21:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-11-27 20:21:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:21:18,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:18,958 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-27 20:21:18,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 20:21:19,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:19,159 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-27 20:21:19,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash 617548677, now seen corresponding path program 1 times [2024-11-27 20:21:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518390398] [2024-11-27 20:21:19,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:19,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:19,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 20:21:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:19,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-27 20:21:19,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:19,298 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-27 20:21:19,309 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 11 treesize of output 5 [2024-11-27 20:21:19,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:21:19,367 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-27 20:21:19,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:19,579 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-27 20:21:19,601 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-27 20:21:19,696 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-27 20:21:19,705 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-27 20:21:19,751 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-27 20:21:19,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:20,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_191) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_192) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_191) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-11-27 20:21:20,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_191) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_192) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_191) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-11-27 20:21:20,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_191) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_191) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_192) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-27 20:21:20,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:20,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-27 20:21:20,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:20,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-27 20:21:20,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-27 20:21:20,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-27 20:21:20,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-27 20:21:20,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:21:20,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:20,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-27 20:21:20,271 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 54 treesize of output 36 [2024-11-27 20:21:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-27 20:21:20,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518390398] [2024-11-27 20:21:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518390398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:21:20,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:21:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-27 20:21:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139359158] [2024-11-27 20:21:20,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:21:20,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 20:21:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:20,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 20:21:20,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2024-11-27 20:21:20,359 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 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-27 20:21:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:22,600 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2024-11-27 20:21:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:21:22,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 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-27 20:21:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:22,602 INFO L225 Difference]: With dead ends: 217 [2024-11-27 20:21:22,603 INFO L226 Difference]: Without dead ends: 217 [2024-11-27 20:21:22,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=136, Unknown=3, NotChecked=78, Total=272 [2024-11-27 20:21:22,604 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:22,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 867 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 244 Unchecked, 2.0s Time] [2024-11-27 20:21:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-27 20:21:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-27 20:21:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 212 states have internal predecessors, (234), 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-27 20:21:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2024-11-27 20:21:22,611 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 23 [2024-11-27 20:21:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:22,612 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2024-11-27 20:21:22,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 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-27 20:21:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2024-11-27 20:21:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-27 20:21:22,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:22,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:22,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-27 20:21:22,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:22,814 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-27 20:21:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 731740651, now seen corresponding path program 2 times [2024-11-27 20:21:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333266261] [2024-11-27 20:21:22,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:21:22,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:22,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:22,817 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:22,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 20:21:23,054 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:21:23,054 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:21:23,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 20:21:23,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:23,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-27 20:21:23,094 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 11 treesize of output 5 [2024-11-27 20:21:23,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:21:23,152 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-27 20:21:23,400 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:23,401 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-27 20:21:23,418 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-27 20:21:23,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:23,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:21:23,697 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-27 20:21:23,812 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-27 20:21:23,821 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-27 20:21:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:23,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:24,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_234) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_233) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_234) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-11-27 20:21:24,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_233) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-11-27 20:21:24,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_233) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd (_ bv12 32) .cse3 .cse2))))))) is different from false [2024-11-27 20:21:24,491 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_232))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_231) .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1) (_ bv12 32) .cse2) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_233) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_231) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_232) c_create_data_~data~0.base) .cse1) v_ArrVal_234) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 (_ bv12 32) .cse2)))))) is different from false [2024-11-27 20:21:24,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_231) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_232) c_create_data_~data~0.base) .cse3) v_ArrVal_234) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_232))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_231) .cse4 v_ArrVal_234) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_233) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-11-27 20:21:24,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_231) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_232) c_create_data_~data~0.base) .cse2) v_ArrVal_234) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_232))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_231) .cse3 v_ArrVal_234) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_233) c_create_data_~data~0.base) .cse2))))))))) is different from false [2024-11-27 20:21:24,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:24,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-27 20:21:24,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:24,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-27 20:21:24,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 640 [2024-11-27 20:21:24,847 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 415 treesize of output 385 [2024-11-27 20:21:24,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 124 [2024-11-27 20:21:24,865 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 124 treesize of output 112 [2024-11-27 20:21:24,871 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 112 treesize of output 84 [2024-11-27 20:21:24,882 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 69 treesize of output 65 [2024-11-27 20:21:25,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:25,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2024-11-27 20:21:25,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:25,063 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 69 treesize of output 60 [2024-11-27 20:21:25,076 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 102 treesize of output 84 [2024-11-27 20:21:25,090 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 286 treesize of output 244 [2024-11-27 20:21:25,099 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 40 [2024-11-27 20:21:25,110 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 20 treesize of output 12 [2024-11-27 20:21:25,121 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 19 treesize of output 11 [2024-11-27 20:21:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-27 20:21:25,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333266261] [2024-11-27 20:21:25,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333266261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:21:25,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:21:25,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-11-27 20:21:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999515577] [2024-11-27 20:21:25,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:21:25,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 20:21:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:25,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 20:21:25,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2024-11-27 20:21:25,273 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:21:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:28,222 INFO L93 Difference]: Finished difference Result 227 states and 248 transitions. [2024-11-27 20:21:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:21:28,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-27 20:21:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:28,224 INFO L225 Difference]: With dead ends: 227 [2024-11-27 20:21:28,224 INFO L226 Difference]: Without dead ends: 227 [2024-11-27 20:21:28,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=210, Unknown=6, NotChecked=210, Total=506 [2024-11-27 20:21:28,225 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 4 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:28,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1311 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 521 Unchecked, 2.5s Time] [2024-11-27 20:21:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-27 20:21:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-27 20:21:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.4186046511627908) internal successors, (244), 222 states have internal predecessors, (244), 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-27 20:21:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 248 transitions. [2024-11-27 20:21:28,232 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 248 transitions. Word has length 28 [2024-11-27 20:21:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:28,232 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 248 transitions. [2024-11-27 20:21:28,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:21:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 248 transitions. [2024-11-27 20:21:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-27 20:21:28,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:28,233 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-27 20:21:28,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 20:21:28,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:28,437 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-27 20:21:28,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1733158075, now seen corresponding path program 3 times [2024-11-27 20:21:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281063795] [2024-11-27 20:21:28,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:21:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:28,440 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:28,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 20:21:29,504 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-27 20:21:29,504 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:21:29,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-27 20:21:29,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:29,523 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-27 20:21:29,533 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 11 treesize of output 5 [2024-11-27 20:21:29,579 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-27 20:21:29,591 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-27 20:21:29,853 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:29,854 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-27 20:21:29,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:21:30,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:30,099 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-27 20:21:30,112 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-27 20:21:30,433 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:30,433 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-27 20:21:30,446 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-27 20:21:30,560 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-27 20:21:30,566 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-27 20:21:30,628 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-27 20:21:30,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:30,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_283) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_284) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_283) c_create_data_~data~0.base) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2024-11-27 20:21:30,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-11-27 20:21:31,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_284) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-11-27 20:21:31,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_281))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_282) .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) (_ bv12 32) .cse2) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_281) c_create_data_~data~0.base) .cse1) v_ArrVal_283) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 (_ bv12 32) .cse2)))))) is different from false [2024-11-27 20:21:31,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) (_ bv12 32) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281) c_create_data_~data~0.base) .cse2) v_ArrVal_283) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse5 (_ bv8 32) .cse3) (bvadd .cse5 (_ bv12 32) .cse3))))))) is different from false [2024-11-27 20:21:31,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) (_ bv16 32) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281) c_create_data_~data~0.base) .cse2) v_ArrVal_283) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse5 (_ bv12 32) .cse3) (bvadd .cse5 (_ bv16 32) .cse3))))))) is different from false [2024-11-27 20:21:33,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_280))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_281))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_279) .cse0 v_ArrVal_282) .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) (_ bv16 32) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_280))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_279) .cse7 v_ArrVal_282) (select (select (store .cse8 .cse7 v_ArrVal_281) c_create_data_~data~0.base) .cse2) v_ArrVal_283))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse6 (_ bv12 32) .cse3) (bvadd .cse6 (_ bv16 32) .cse3)))))) is different from false [2024-11-27 20:21:35,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse1 v_ArrVal_282) .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_284) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse8 v_ArrVal_282) (select (select (store .cse9 .cse8 v_ArrVal_281) c_create_data_~data~0.base) .cse3) v_ArrVal_283))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) .cse7 .cse4) (bvadd (_ bv16 32) .cse7 .cse4))))))) is different from false [2024-11-27 20:21:35,368 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse1 v_ArrVal_282) .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_284) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse7 v_ArrVal_282) (select (select (store .cse8 .cse7 v_ArrVal_281) c_create_data_~data~0.base) .cse3) v_ArrVal_283))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) .cse6) (bvadd (_ bv16 32) .cse6))))))) is different from false [2024-11-27 20:21:35,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:35,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 177 treesize of output 168 [2024-11-27 20:21:35,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:35,464 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 157 treesize of output 108 [2024-11-27 20:21:35,484 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 588 treesize of output 498 [2024-11-27 20:21:35,509 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 1294 treesize of output 1204 [2024-11-27 20:21:35,539 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 48 [2024-11-27 20:21:35,560 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 40 [2024-11-27 20:21:35,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 40 treesize of output 32 [2024-11-27 20:21:35,599 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 49 [2024-11-27 20:21:35,628 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 20 treesize of output 12 [2024-11-27 20:21:35,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:35,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-11-27 20:21:35,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:35,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2024-11-27 20:21:35,821 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:21:35,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 916 treesize of output 610 [2024-11-27 20:21:35,856 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:21:35,867 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-27 20:21:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2024-11-27 20:21:36,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281063795] [2024-11-27 20:21:36,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281063795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:21:36,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:21:36,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2024-11-27 20:21:36,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532371209] [2024-11-27 20:21:36,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:21:36,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-27 20:21:36,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:36,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-27 20:21:36,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600 [2024-11-27 20:21:36,150 INFO L87 Difference]: Start difference. First operand 227 states and 248 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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-27 20:21:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:44,748 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2024-11-27 20:21:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:21:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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-27 20:21:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:44,750 INFO L225 Difference]: With dead ends: 237 [2024-11-27 20:21:44,750 INFO L226 Difference]: Without dead ends: 237 [2024-11-27 20:21:44,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=105, Invalid=302, Unknown=9, NotChecked=396, Total=812 [2024-11-27 20:21:44,751 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 6 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 828 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:44,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1758 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 784 Invalid, 0 Unknown, 828 Unchecked, 7.3s Time] [2024-11-27 20:21:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-27 20:21:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-27 20:21:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 232 states have internal predecessors, (254), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:21:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2024-11-27 20:21:44,758 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 33 [2024-11-27 20:21:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2024-11-27 20:21:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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-27 20:21:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2024-11-27 20:21:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:21:44,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:44,760 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:44,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:44,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-27 20:21:44,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1913765333, now seen corresponding path program 4 times [2024-11-27 20:21:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149763746] [2024-11-27 20:21:44,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 20:21:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:44,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:44,963 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:44,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 20:21:47,422 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 20:21:47,423 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:21:47,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-27 20:21:47,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:47,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:21:47,532 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 11 treesize of output 5 [2024-11-27 20:21:47,584 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-27 20:21:47,702 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-27 20:21:47,762 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-27 20:21:48,502 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:48,502 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-27 20:21:48,547 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-27 20:21:49,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:49,205 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-27 20:21:49,239 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-27 20:21:50,043 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:50,043 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-27 20:21:50,090 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-27 20:21:50,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:50,793 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-27 20:21:50,809 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-27 20:21:51,174 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-27 20:21:51,189 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-27 20:21:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:51,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:52,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_341) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_342) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_341) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-11-27 20:21:52,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-11-27 20:21:52,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-11-27 20:21:52,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_339))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_340) .cse0 v_ArrVal_341) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_342) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_339) c_create_data_~data~0.base) .cse1) v_ArrVal_341) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd (_ bv12 32) .cse4 .cse2)))))) is different from false [2024-11-27 20:21:52,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_339))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_340) .cse4 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-11-27 20:21:52,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_339))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_340) .cse1 v_ArrVal_341) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_342) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_339) c_create_data_~data~0.base) .cse2) v_ArrVal_341) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv12 32) .cse5 .cse3) (bvadd (_ bv16 32) .cse5 .cse3))))))) is different from false [2024-11-27 20:21:53,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_338))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_339))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_337) .cse0 v_ArrVal_340) .cse1 v_ArrVal_341) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_342) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_338))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_337) .cse7 v_ArrVal_340) (select (select (store .cse8 .cse7 v_ArrVal_339) c_create_data_~data~0.base) .cse2) v_ArrVal_341))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv12 32) .cse6 .cse3) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2024-11-27 20:21:53,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) (_ bv16 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse8 v_ArrVal_340) (select (select (store .cse9 .cse8 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse7 (_ bv12 32) .cse4) (bvadd .cse7 (_ bv16 32) .cse4))))))) is different from false [2024-11-27 20:21:53,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) (_ bv20 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse8 v_ArrVal_340) (select (select (store .cse9 .cse8 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse7 (_ bv16 32) .cse4) (bvadd .cse7 (_ bv20 32) .cse4))))))) is different from false [2024-11-27 20:21:54,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_335))) (let ((.cse0 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_338))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_336) .cse0 v_ArrVal_337) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_335))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_338))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_336) .cse9 v_ArrVal_337) .cse10 v_ArrVal_340) (select (select (store .cse11 .cse10 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse8 .cse4) (bvadd (_ bv20 32) .cse8 .cse4)))))) is different from false [2024-11-27 20:21:56,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_335))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_338))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_336) .cse3 v_ArrVal_337) .cse4 v_ArrVal_340) (select (select (store .cse5 .cse4 v_ArrVal_339) c_create_data_~data~0.base) .cse6) v_ArrVal_341))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd (_ bv20 32) .cse0 .cse1)))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_335))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_338))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_339))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_336) .cse8 v_ArrVal_337) .cse9 v_ArrVal_340) .cse10 v_ArrVal_341) c_create_data_~data~0.base) .cse6) .cse1) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_342) c_create_data_~data~0.base) .cse6))))))))))))) is different from false [2024-11-27 20:21:56,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_335))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_338))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_336) .cse2 v_ArrVal_337) .cse3 v_ArrVal_340) (select (select (store .cse4 .cse3 v_ArrVal_339) c_create_data_~data~0.base) .cse5) v_ArrVal_341))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_335))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_338))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_339))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_336) .cse7 v_ArrVal_337) .cse8 v_ArrVal_340) .cse9 v_ArrVal_341) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_342) c_create_data_~data~0.base) .cse5))))))))))))) is different from false [2024-11-27 20:21:56,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:56,856 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 353 treesize of output 354 [2024-11-27 20:21:56,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:56,911 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 343 treesize of output 204 [2024-11-27 20:21:57,000 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 1621162 treesize of output 1380016 [2024-11-27 20:21:58,505 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 41667 treesize of output 41127 [2024-11-27 20:21:58,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 549 treesize of output 485 [2024-11-27 20:21:58,603 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 485 treesize of output 461 [2024-11-27 20:21:58,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 401 [2024-11-27 20:21:58,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 381 [2024-11-27 20:21:58,661 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 381 treesize of output 333 [2024-11-27 20:21:58,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 333 treesize of output 321 [2024-11-27 20:21:58,707 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 268 treesize of output 264 [2024-11-27 20:21:58,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 297 [2024-11-27 20:21:59,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:59,957 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 353 treesize of output 344 [2024-11-27 20:22:00,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:00,020 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 333 treesize of output 204 [2024-11-27 20:22:00,075 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 6652 treesize of output 5674 [2024-11-27 20:22:00,137 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 17806 treesize of output 17332 [2024-11-27 20:22:00,174 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 89 treesize of output 81 [2024-11-27 20:22:00,196 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 81 treesize of output 73 [2024-11-27 20:22:00,221 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 73 treesize of output 65 [2024-11-27 20:22:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-11-27 20:22:00,270 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 49 [2024-11-27 20:22:00,288 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 74 treesize of output 66 [2024-11-27 20:22:00,319 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 20 treesize of output 12 [2024-11-27 20:22:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2024-11-27 20:22:00,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:22:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149763746] [2024-11-27 20:22:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149763746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:22:00,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:22:00,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2024-11-27 20:22:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980511796] [2024-11-27 20:22:00,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:22:00,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-27 20:22:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:22:00,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-27 20:22:00,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=12, NotChecked=516, Total=870 [2024-11-27 20:22:00,644 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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-27 20:22:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:08,877 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2024-11-27 20:22:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:22:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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 38 [2024-11-27 20:22:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:08,880 INFO L225 Difference]: With dead ends: 247 [2024-11-27 20:22:08,880 INFO L226 Difference]: Without dead ends: 247 [2024-11-27 20:22:08,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=130, Invalid=412, Unknown=12, NotChecked=636, Total=1190 [2024-11-27 20:22:08,881 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1165 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:08,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1771 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 617 Invalid, 0 Unknown, 1165 Unchecked, 6.2s Time] [2024-11-27 20:22:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-27 20:22:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-27 20:22:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 192 states have (on average 1.375) internal successors, (264), 242 states have internal predecessors, (264), 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-27 20:22:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 268 transitions. [2024-11-27 20:22:08,896 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 268 transitions. Word has length 38 [2024-11-27 20:22:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:08,896 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 268 transitions. [2024-11-27 20:22:08,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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-27 20:22:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 268 transitions. [2024-11-27 20:22:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-27 20:22:08,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:08,900 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:08,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-27 20:22:09,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:22:09,101 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-27 20:22:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:09,102 INFO L85 PathProgramCache]: Analyzing trace with hash -556500219, now seen corresponding path program 5 times [2024-11-27 20:22:09,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:22:09,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808031550] [2024-11-27 20:22:09,102 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 20:22:09,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:22:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:22:09,104 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:22:09,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d46c543-5a99-4bae-9934-be0ac27d2b8f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 20:22:13,489 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-27 20:22:13,489 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:22:13,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-27 20:22:13,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:13,539 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-27 20:22:13,568 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 11 treesize of output 5 [2024-11-27 20:22:13,684 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-27 20:22:13,714 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-27 20:22:14,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:14,408 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-27 20:22:14,445 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-27 20:22:15,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:15,173 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-27 20:22:15,222 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-27 20:22:15,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:15,983 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-27 20:22:16,016 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-27 20:22:16,831 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:16,831 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-27 20:22:16,881 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-27 20:22:17,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:17,681 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-27 20:22:17,730 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-27 20:22:18,174 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-27 20:22:18,193 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-27 20:22:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:22:18,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:22:19,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_407) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_407) c_create_data_~data~0.base) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_408) c_create_data_~data~0.base) .cse2)))))) is different from false [2024-11-27 20:22:19,379 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_407) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_408) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_407) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-11-27 20:22:19,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_408) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-11-27 20:22:21,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) .cse4 v_ArrVal_407) c_create_data_~data~0.base) .cse3) (_ bv12 32) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_408) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-11-27 20:22:21,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv12 32) .cse1) (bvadd .cse0 (_ bv16 32) .cse1)))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) .cse4 v_ArrVal_407) c_create_data_~data~0.base) .cse3) (_ bv16 32) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_408) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-11-27 20:22:21,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_403))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_404) .cse2 v_ArrVal_406) (select (select (store .cse3 .cse2 v_ArrVal_405) c_create_data_~data~0.base) .cse4) v_ArrVal_407))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv12 32) .cse0 .cse1) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_403))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_405))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_404) .cse5 v_ArrVal_406) .cse6 v_ArrVal_407) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_408) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2024-11-27 20:22:21,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_405))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse1 v_ArrVal_406) .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_408) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse8 v_ArrVal_406) (select (select (store .cse9 .cse8 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) .cse7 .cse4) (bvadd (_ bv16 32) .cse7 .cse4))))))) is different from false [2024-11-27 20:22:21,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_405))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse1 v_ArrVal_406) .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_408) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse8 v_ArrVal_406) (select (select (store .cse9 .cse8 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse7 .cse4) (bvadd (_ bv20 32) .cse7 .cse4))))))) is different from false [2024-11-27 20:22:24,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_401))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_403))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_402) .cse2 v_ArrVal_404) .cse3 v_ArrVal_406) (select (select (store .cse4 .cse3 v_ArrVal_405) c_create_data_~data~0.base) .cse5) v_ArrVal_407))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 (_ bv16 32) .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_401))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_403))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_405))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_402) .cse7 v_ArrVal_404) .cse8 v_ArrVal_406) .cse9 v_ArrVal_407) c_create_data_~data~0.base) .cse5) (_ bv20 32) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_408) c_create_data_~data~0.base) .cse5)))))))))))) is different from false [2024-11-27 20:22:27,706 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_401))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_403))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_405))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_402) .cse1 v_ArrVal_404) .cse2 v_ArrVal_406) .cse3 v_ArrVal_407) c_create_data_~data~0.base) .cse4) .cse5) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_408) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_401))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_403))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_402) .cse10 v_ArrVal_404) .cse11 v_ArrVal_406) (select (select (store .cse12 .cse11 v_ArrVal_405) c_create_data_~data~0.base) .cse4) v_ArrVal_407))))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) .cse9 .cse5) (bvadd (_ bv20 32) .cse9 .cse5))))))) is different from false [2024-11-27 20:22:45,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_399))) (let ((.cse0 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_401))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_403))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_405))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_400) .cse0 v_ArrVal_402) .cse1 v_ArrVal_404) .cse2 v_ArrVal_406) .cse3 v_ArrVal_407) c_create_data_~data~0.base) .cse4) .cse5) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_408) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_399))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_401))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_403))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_400) .cse11 v_ArrVal_402) .cse12 v_ArrVal_404) .cse13 v_ArrVal_406) (select (select (store .cse14 .cse13 v_ArrVal_405) c_create_data_~data~0.base) .cse4) v_ArrVal_407))))))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv20 32) .cse10 .cse5) (bvadd (_ bv24 32) .cse10 .cse5)))))) is different from false [2024-11-27 20:22:51,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse7))) (and (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_399))) (let ((.cse3 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_401))) (let ((.cse4 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_403))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_400) .cse3 v_ArrVal_402) .cse4 v_ArrVal_404) .cse5 v_ArrVal_406) (select (select (store .cse6 .cse5 v_ArrVal_405) c_create_data_~data~0.base) .cse7) v_ArrVal_407))))))) c_create_data_~data~0.base) .cse7))) (bvule (bvadd (_ bv20 32) .cse0 .cse1) (bvadd (_ bv24 32) .cse0 .cse1)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_399))) (let ((.cse10 (select (select .cse17 c_create_data_~data~0.base) .cse7))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_401))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse7))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_403))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse7))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_405))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_400) .cse10 v_ArrVal_402) .cse11 v_ArrVal_404) .cse12 v_ArrVal_406) .cse13 v_ArrVal_407) c_create_data_~data~0.base) .cse7) .cse1) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_408) c_create_data_~data~0.base) .cse7))))))))))))))) is different from false [2024-11-27 20:22:56,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_399))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_401))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_403))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_405))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_400) .cse1 v_ArrVal_402) .cse2 v_ArrVal_404) .cse3 v_ArrVal_406) .cse4 v_ArrVal_407) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_408) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_399))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_401))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_403))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_400) .cse11 v_ArrVal_402) .cse12 v_ArrVal_404) .cse13 v_ArrVal_406) (select (select (store .cse14 .cse13 v_ArrVal_405) c_create_data_~data~0.base) .cse5) v_ArrVal_407))))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv20 32) .cse10) (bvadd (_ bv24 32) .cse10))))))) is different from false [2024-11-27 20:22:56,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:56,863 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 705 treesize of output 706 [2024-11-27 20:22:57,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:57,179 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 695 treesize of output 396 [2024-11-27 20:22:57,750 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 24158553966 treesize of output 21188534388