./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/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_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:24:38,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:24:38,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:24:38,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:24:38,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:24:38,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:24:38,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:24:38,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:24:38,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:24:38,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:24:38,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:24:38,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:24:38,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:24:38,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:24:38,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:24:38,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:24:38,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:24:38,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:24:38,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:24:38,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:24:38,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:24:38,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:24:38,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:24:38,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:24:38,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:24:38,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:24:38,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:24:38,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:24:38,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:24:38,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:24:38,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:24:38,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:24:38,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:24:38,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:24:38,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:24:38,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:24:38,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:24:38,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:24:38,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:24:38,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:24:38,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:24:38,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:24:38,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:24:38,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:24:38,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:24:38,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:24:38,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:24:38,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:24:38,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:24:38,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:24:38,248 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:24:38,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:24:38,250 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:24:38,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:24:38,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:24:38,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:24:38,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:24:38,251 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:24:38,251 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:24:38,252 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:24:38,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:24:38,252 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:24:38,252 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:24:38,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:24:38,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:24:38,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:24:38,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:24:38,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:24:38,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:24:38,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:24:38,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:24:38,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:24:38,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-11-02 20:24:38,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:24:38,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:24:38,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:24:38,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:24:38,635 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:24:38,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-02 20:24:38,732 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/929b48db3/f1f200e0db064fe3af494d0d7c5ddce8/FLAG6ce5698e8 [2022-11-02 20:24:39,545 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:24:39,546 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-02 20:24:39,563 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/929b48db3/f1f200e0db064fe3af494d0d7c5ddce8/FLAG6ce5698e8 [2022-11-02 20:24:39,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/929b48db3/f1f200e0db064fe3af494d0d7c5ddce8 [2022-11-02 20:24:39,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:24:39,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:24:39,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:39,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:24:39,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:24:39,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:39" (1/1) ... [2022-11-02 20:24:39,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1661aadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:39, skipping insertion in model container [2022-11-02 20:24:39,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:39" (1/1) ... [2022-11-02 20:24:39,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:24:39,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:24:40,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:40,297 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-02 20:24:40,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4dda595b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:40, skipping insertion in model container [2022-11-02 20:24:40,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:40,300 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-02 20:24:40,302 INFO L158 Benchmark]: Toolchain (without parser) took 508.27ms. Allocated memory is still 153.1MB. Free memory was 118.3MB in the beginning and 124.2MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:24:40,303 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 100.7MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:24:40,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.60ms. Allocated memory is still 153.1MB. Free memory was 118.3MB in the beginning and 124.2MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:24:40,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 100.7MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.60ms. Allocated memory is still 153.1MB. Free memory was 118.3MB in the beginning and 124.2MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/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_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:24:43,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:24:43,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:24:43,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:24:43,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:24:43,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:24:43,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:24:43,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:24:43,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:24:43,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:24:43,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:24:43,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:24:43,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:24:43,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:24:43,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:24:43,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:24:43,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:24:43,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:24:43,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:24:43,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:24:43,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:24:43,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:24:43,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:24:43,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:24:43,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:24:43,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:24:43,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:24:43,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:24:43,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:24:43,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:24:43,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:24:43,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:24:43,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:24:43,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:24:43,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:24:43,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:24:43,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:24:43,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:24:43,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:24:43,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:24:43,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:24:43,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-02 20:24:43,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:24:43,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:24:43,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:24:43,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:24:43,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:24:43,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:24:43,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:24:43,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:24:43,233 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:24:43,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:24:43,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:24:43,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:24:43,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:24:43,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:24:43,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:24:43,236 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:24:43,237 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:24:43,237 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:24:43,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:24:43,238 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:24:43,238 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:24:43,238 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:24:43,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:24:43,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:24:43,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:24:43,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:24:43,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:24:43,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:24:43,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:24:43,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:24:43,241 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:24:43,241 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:24:43,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:24:43,242 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-11-02 20:24:43,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:24:43,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:24:43,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:24:43,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:24:43,799 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:24:43,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-02 20:24:43,883 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/3ead5158e/e2e3c2f1dbba45408e99c894d19e266b/FLAG793f4d562 [2022-11-02 20:24:44,662 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:24:44,662 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-11-02 20:24:44,687 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/3ead5158e/e2e3c2f1dbba45408e99c894d19e266b/FLAG793f4d562 [2022-11-02 20:24:44,923 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/data/3ead5158e/e2e3c2f1dbba45408e99c894d19e266b [2022-11-02 20:24:44,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:24:44,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:24:44,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:44,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:24:44,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:24:44,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:44" (1/1) ... [2022-11-02 20:24:44,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d29200e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:44, skipping insertion in model container [2022-11-02 20:24:44,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:44" (1/1) ... [2022-11-02 20:24:44,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:24:44,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:24:45,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:45,508 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-02 20:24:45,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:24:45,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:45,567 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:24:45,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:45,653 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:24:45,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45 WrapperNode [2022-11-02 20:24:45,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:45,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:24:45,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:24:45,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:24:45,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,716 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-11-02 20:24:45,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:24:45,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:24:45,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:24:45,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:24:45,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,763 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:24:45,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:24:45,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:24:45,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:24:45,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (1/1) ... [2022-11-02 20:24:45,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:24:45,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:45,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:24:45,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:24:45,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 20:24:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:24:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-11-02 20:24:45,936 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-11-02 20:24:45,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:24:45,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:24:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:24:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:24:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:24:45,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:24:45,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:24:45,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:24:45,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:24:45,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:24:46,168 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:24:46,171 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:24:47,341 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:24:47,353 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:24:47,353 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:24:47,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:24:47 BoogieIcfgContainer [2022-11-02 20:24:47,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:24:47,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:24:47,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:24:47,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:24:47,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:24:44" (1/3) ... [2022-11-02 20:24:47,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:24:47, skipping insertion in model container [2022-11-02 20:24:47,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:45" (2/3) ... [2022-11-02 20:24:47,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:24:47, skipping insertion in model container [2022-11-02 20:24:47,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:24:47" (3/3) ... [2022-11-02 20:24:47,372 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2022-11-02 20:24:47,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:24:47,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-11-02 20:24:47,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:24:47,467 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1f7466de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:24:47,467 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-11-02 20:24:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 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) [2022-11-02 20:24:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:24:47,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:47,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:24:47,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-11-02 20:24:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:47,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979768519] [2022-11-02 20:24:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:47,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:47,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:47,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:24:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:47,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:24:47,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:47,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:47,787 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:24:47,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-11-02 20:24:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:47,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:47,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:47,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979768519] [2022-11-02 20:24:47,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979768519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:47,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:47,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773277114] [2022-11-02 20:24:47,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:47,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:47,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:47,906 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 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) 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) [2022-11-02 20:24:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:48,950 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-11-02 20:24:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:24:48,957 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 [2022-11-02 20:24:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:48,977 INFO L225 Difference]: With dead ends: 208 [2022-11-02 20:24:48,977 INFO L226 Difference]: Without dead ends: 206 [2022-11-02 20:24:48,979 INFO L412 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 [2022-11-02 20:24:48,988 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:48,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:24:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-02 20:24:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-11-02 20:24:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 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) [2022-11-02 20:24:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-11-02 20:24:49,088 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-11-02 20:24:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:49,089 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-11-02 20:24:49,090 INFO L496 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) [2022-11-02 20:24:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-11-02 20:24:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:24:49,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:49,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:24:49,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:49,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:49,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-11-02 20:24:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:49,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899347532] [2022-11-02 20:24:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:49,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:49,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:49,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:49,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:24:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:49,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:24:49,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:49,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:49,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:49,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:24:49,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-11-02 20:24:49,645 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:24:49,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:49,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:49,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899347532] [2022-11-02 20:24:49,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899347532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:49,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:49,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977907368] [2022-11-02 20:24:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:49,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:49,695 INFO L87 Difference]: Start difference. First operand 180 states and 191 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) [2022-11-02 20:24:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:50,835 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-11-02 20:24:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:50,837 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 [2022-11-02 20:24:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:50,840 INFO L225 Difference]: With dead ends: 196 [2022-11-02 20:24:50,841 INFO L226 Difference]: Without dead ends: 196 [2022-11-02 20:24:50,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:24:50,843 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:50,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:24:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-02 20:24:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-11-02 20:24:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 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) [2022-11-02 20:24:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-11-02 20:24:50,860 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-11-02 20:24:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:50,861 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-11-02 20:24:50,861 INFO L496 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) [2022-11-02 20:24:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-11-02 20:24:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:24:50,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:50,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:24:50,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:51,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:51,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-11-02 20:24:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:51,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512365887] [2022-11-02 20:24:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:51,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:51,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:51,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:51,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:24:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:51,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:24:51,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:51,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:51,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:51,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:51,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512365887] [2022-11-02 20:24:51,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512365887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:51,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:51,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:24:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46300977] [2022-11-02 20:24:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:51,225 INFO L87 Difference]: Start difference. First operand 185 states and 198 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) [2022-11-02 20:24:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:51,755 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-11-02 20:24:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:51,756 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 [2022-11-02 20:24:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:51,758 INFO L225 Difference]: With dead ends: 208 [2022-11-02 20:24:51,758 INFO L226 Difference]: Without dead ends: 208 [2022-11-02 20:24:51,759 INFO L412 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 [2022-11-02 20:24:51,760 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:51,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:24:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-02 20:24:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-11-02 20:24:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 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) [2022-11-02 20:24:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-11-02 20:24:51,777 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-11-02 20:24:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:51,778 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-11-02 20:24:51,778 INFO L496 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) [2022-11-02 20:24:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-11-02 20:24:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:24:51,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:51,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:24:51,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:51,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:51,996 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-11-02 20:24:51,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:51,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998598420] [2022-11-02 20:24:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:51,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:51,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:52,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:52,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 20:24:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:52,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:24:52,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:52,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:52,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:52,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:52,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998598420] [2022-11-02 20:24:52,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998598420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:52,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:52,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:24:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027094125] [2022-11-02 20:24:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:52,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:52,169 INFO L87 Difference]: Start difference. First operand 183 states and 195 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) [2022-11-02 20:24:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:52,753 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-11-02 20:24:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:52,754 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 [2022-11-02 20:24:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:52,755 INFO L225 Difference]: With dead ends: 181 [2022-11-02 20:24:52,756 INFO L226 Difference]: Without dead ends: 181 [2022-11-02 20:24:52,756 INFO L412 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 [2022-11-02 20:24:52,757 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:52,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:24:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-02 20:24:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-02 20:24:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 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) [2022-11-02 20:24:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-11-02 20:24:52,784 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-11-02 20:24:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:52,785 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-11-02 20:24:52,785 INFO L496 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) [2022-11-02 20:24:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-11-02 20:24:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:24:52,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:52,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:52,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:53,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:53,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-11-02 20:24:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:53,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582352433] [2022-11-02 20:24:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:53,007 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:53,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 20:24:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:53,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:24:53,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:53,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:53,219 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:24:53,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:53,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:24:53,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:24:53,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-02 20:24:53,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-02 20:24:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:53,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:53,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:53,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582352433] [2022-11-02 20:24:53,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582352433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:53,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:53,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:24:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559619758] [2022-11-02 20:24:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:24:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:24:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:53,453 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2022-11-02 20:24:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:54,238 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-11-02 20:24:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:24:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 [2022-11-02 20:24:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:54,240 INFO L225 Difference]: With dead ends: 183 [2022-11-02 20:24:54,240 INFO L226 Difference]: Without dead ends: 183 [2022-11-02 20:24:54,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:24:54,242 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:54,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 602 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:24:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-02 20:24:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-11-02 20:24:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 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) [2022-11-02 20:24:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-11-02 20:24:54,252 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-11-02 20:24:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:54,253 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-11-02 20:24:54,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2022-11-02 20:24:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-11-02 20:24:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:24:54,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:54,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:54,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:54,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:54,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-11-02 20:24:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:54,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782252014] [2022-11-02 20:24:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:54,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:54,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:54,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:54,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 20:24:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:54,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:24:54,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:54,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:54,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:54,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782252014] [2022-11-02 20:24:54,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782252014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:54,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:54,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754375677] [2022-11-02 20:24:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:54,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:54,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:54,633 INFO L87 Difference]: Start difference. First operand 182 states and 193 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) [2022-11-02 20:24:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:54,685 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-11-02 20:24:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:24:54,686 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 [2022-11-02 20:24:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:54,688 INFO L225 Difference]: With dead ends: 258 [2022-11-02 20:24:54,688 INFO L226 Difference]: Without dead ends: 258 [2022-11-02 20:24:54,689 INFO L412 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 [2022-11-02 20:24:54,690 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:54,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-02 20:24:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-11-02 20:24:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 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) [2022-11-02 20:24:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-11-02 20:24:54,701 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-11-02 20:24:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:54,702 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-11-02 20:24:54,702 INFO L496 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) [2022-11-02 20:24:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-11-02 20:24:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:24:54,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:54,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:54,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:54,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:54,925 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-11-02 20:24:54,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:54,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158083932] [2022-11-02 20:24:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:54,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:54,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:54,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:54,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 20:24:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:55,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:24:55,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:55,092 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:24:55,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 20:24:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:55,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:55,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:55,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158083932] [2022-11-02 20:24:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158083932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:55,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:55,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:24:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250814225] [2022-11-02 20:24:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:55,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:55,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:55,137 INFO L87 Difference]: Start difference. First operand 222 states and 273 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) [2022-11-02 20:24:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:55,644 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-11-02 20:24:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:55,646 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 [2022-11-02 20:24:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:55,647 INFO L225 Difference]: With dead ends: 209 [2022-11-02 20:24:55,647 INFO L226 Difference]: Without dead ends: 209 [2022-11-02 20:24:55,648 INFO L412 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 [2022-11-02 20:24:55,649 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:55,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:24:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-02 20:24:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-11-02 20:24:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:24:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2022-11-02 20:24:55,658 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 13 [2022-11-02 20:24:55,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:55,658 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2022-11-02 20:24:55,659 INFO L496 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) [2022-11-02 20:24:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2022-11-02 20:24:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:24:55,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:55,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:55,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-02 20:24:55,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:55,875 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-11-02 20:24:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:55,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034920968] [2022-11-02 20:24:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:55,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:55,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:55,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-02 20:24:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:24:56,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:56,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:24:56,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 11 [2022-11-02 20:24:56,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:56,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:56,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:56,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034920968] [2022-11-02 20:24:56,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034920968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:56,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:56,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:24:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197424445] [2022-11-02 20:24:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:56,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:56,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:56,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:56,112 INFO L87 Difference]: Start difference. First operand 207 states and 243 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) [2022-11-02 20:24:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:56,671 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2022-11-02 20:24:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:56,672 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 [2022-11-02 20:24:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:56,674 INFO L225 Difference]: With dead ends: 194 [2022-11-02 20:24:56,674 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:24:56,674 INFO L412 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 [2022-11-02 20:24:56,675 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:56,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:24:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:24:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-11-02 20:24:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 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) [2022-11-02 20:24:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2022-11-02 20:24:56,683 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 13 [2022-11-02 20:24:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:56,684 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2022-11-02 20:24:56,684 INFO L496 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) [2022-11-02 20:24:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2022-11-02 20:24:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:24:56,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:56,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:56,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:56,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:56,896 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-11-02 20:24:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:56,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611528108] [2022-11-02 20:24:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:56,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:56,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:56,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-02 20:24:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:57,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:24:57,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:57,076 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 20:24:57,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-02 20:24:57,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:57,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:57,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:57,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:57,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611528108] [2022-11-02 20:24:57,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611528108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:57,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:57,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623003387] [2022-11-02 20:24:57,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:57,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:24:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:24:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:24:57,162 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-11-02 20:24:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:58,153 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-11-02 20:24:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:24:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 17 [2022-11-02 20:24:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:58,156 INFO L225 Difference]: With dead ends: 243 [2022-11-02 20:24:58,157 INFO L226 Difference]: Without dead ends: 243 [2022-11-02 20:24:58,157 INFO L412 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 [2022-11-02 20:24:58,158 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 25 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:58,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 387 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:24:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-02 20:24:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2022-11-02 20:24:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 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) [2022-11-02 20:24:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2022-11-02 20:24:58,170 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 17 [2022-11-02 20:24:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:58,170 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2022-11-02 20:24:58,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-11-02 20:24:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-11-02 20:24:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:24:58,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:58,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:58,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:58,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:24:58,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:24:58,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-11-02 20:24:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:24:58,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143020844] [2022-11-02 20:24:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:58,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:24:58,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:24:58,393 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:24:58,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-02 20:24:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:58,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:24:58,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:58,581 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:24:58,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 20:24:58,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:58,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:58,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:24:58,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:24:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:58,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:58,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:24:58,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143020844] [2022-11-02 20:24:58,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143020844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:58,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:58,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:24:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977953142] [2022-11-02 20:24:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:58,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:24:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:24:58,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:24:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:58,788 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-11-02 20:25:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:00,114 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-11-02 20:25:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:00,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 17 [2022-11-02 20:25:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:00,120 INFO L225 Difference]: With dead ends: 200 [2022-11-02 20:25:00,120 INFO L226 Difference]: Without dead ends: 200 [2022-11-02 20:25:00,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:00,121 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:00,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 486 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:25:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-02 20:25:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2022-11-02 20:25:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 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) [2022-11-02 20:25:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-11-02 20:25:00,131 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 17 [2022-11-02 20:25:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:00,131 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-11-02 20:25:00,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-11-02 20:25:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-11-02 20:25:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:25:00,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:00,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:00,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:25:00,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:25:00,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:25:00,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-11-02 20:25:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:25:00,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686602682] [2022-11-02 20:25:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:00,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:25:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:25:00,352 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:25:00,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-02 20:25:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:00,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:25:00,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:25:00,628 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:25:00,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:00,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:25:00,863 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:00,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 37 [2022-11-02 20:25:00,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:25:01,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:25:01,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)))) is different from false [2022-11-02 20:25:01,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2022-11-02 20:25:01,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:01,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:01,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:01,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:25:01,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:25:01,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686602682] [2022-11-02 20:25:01,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686602682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:25:01,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:25:01,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-11-02 20:25:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335032628] [2022-11-02 20:25:01,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:25:01,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:25:01,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:25:01,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:25:01,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-11-02 20:25:01,276 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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) [2022-11-02 20:25:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:02,767 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2022-11-02 20:25:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:25:02,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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 22 [2022-11-02 20:25:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:02,770 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:25:02,770 INFO L226 Difference]: Without dead ends: 203 [2022-11-02 20:25:02,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2022-11-02 20:25:02,771 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 25 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:02,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 797 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 333 Unchecked, 1.3s Time] [2022-11-02 20:25:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-02 20:25:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2022-11-02 20:25:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 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) [2022-11-02 20:25:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2022-11-02 20:25:02,780 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 22 [2022-11-02 20:25:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:02,781 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2022-11-02 20:25:02,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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) [2022-11-02 20:25:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2022-11-02 20:25:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:25:02,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:02,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:02,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:25:02,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:25:03,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:25:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-11-02 20:25:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:25:03,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491893158] [2022-11-02 20:25:03,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:03,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:25:03,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:25:03,005 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:25:03,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-02 20:25:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:03,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 20:25:03,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:25:03,292 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:25:03,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 20:25:03,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:03,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:25:03,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:03,574 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:03,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:03,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:03,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:03,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:25:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:03,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:25:04,559 WARN L833 $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_220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_220) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-02 20:25:04,668 WARN L833 $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$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_220) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-02 20:25:04,772 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-02 20:25:04,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:04,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:04,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:04,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:04,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:04,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:04,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:04,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 58 [2022-11-02 20:25:05,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:05,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:05,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:25:05,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:25:05,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491893158] [2022-11-02 20:25:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491893158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:25:05,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:25:05,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-02 20:25:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442313171] [2022-11-02 20:25:05,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:25:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:25:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:25:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:25:05,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-11-02 20:25:05,325 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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) [2022-11-02 20:25:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:09,698 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-11-02 20:25:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:25:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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 22 [2022-11-02 20:25:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:09,702 INFO L225 Difference]: With dead ends: 209 [2022-11-02 20:25:09,702 INFO L226 Difference]: Without dead ends: 209 [2022-11-02 20:25:09,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-11-02 20:25:09,704 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 14 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:09,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 887 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 464 Invalid, 0 Unknown, 237 Unchecked, 3.9s Time] [2022-11-02 20:25:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-02 20:25:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-11-02 20:25:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 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) [2022-11-02 20:25:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2022-11-02 20:25:09,725 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 22 [2022-11-02 20:25:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:09,726 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2022-11-02 20:25:09,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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) [2022-11-02 20:25:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2022-11-02 20:25:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:25:09,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:09,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:09,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:25:09,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:25:09,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:25:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-11-02 20:25:09,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:25:09,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586113535] [2022-11-02 20:25:09,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:25:09,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:25:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:25:09,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:25:09,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-02 20:25:10,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:25:10,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:25:10,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:25:10,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:25:10,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:10,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 11 [2022-11-02 20:25:10,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:25:10,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:10,617 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:10,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:10,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:10,874 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:10,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:10,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:11,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:11,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:25:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:11,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:25:11,868 WARN L833 $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_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-11-02 20:25:11,975 WARN L833 $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$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-02 20:25:12,076 WARN L833 $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$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_282) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2022-11-02 20:25:12,399 WARN L833 $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_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_281) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_280) c_create_data_~data~0.base) .cse2) v_ArrVal_282) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((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 ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_280))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_281) .cse3 v_ArrVal_282) c_create_data_~data~0.base) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_283) c_create_data_~data~0.base) .cse2)))))))) is different from false [2022-11-02 20:25:12,765 WARN L833 $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$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((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 ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_281) .cse1 v_ArrVal_282) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_281) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280) c_create_data_~data~0.base) .cse2) v_ArrVal_282) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-02 20:25:12,885 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_281) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_280) c_create_data_~data~0.base) .cse2) v_ArrVal_282) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((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 ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_280))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_281) .cse3 v_ArrVal_282) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_283) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-11-02 20:25:12,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:12,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:12,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:12,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:12,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:12,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 174 treesize of output 144 [2022-11-02 20:25:13,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 86 [2022-11-02 20:25:13,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 [2022-11-02 20:25:13,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 62 [2022-11-02 20:25:13,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:13,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:13,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:13,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:13,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:25:13,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:13,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:25:13,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 32 [2022-11-02 20:25:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-02 20:25:13,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:25:13,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586113535] [2022-11-02 20:25:13,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586113535] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:25:13,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:25:13,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-11-02 20:25:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736510028] [2022-11-02 20:25:13,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:25:13,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:25:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:25:13,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:25:13,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-11-02 20:25:13,346 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:18,692 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2022-11-02 20:25:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:25:18,694 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:25:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:18,695 INFO L225 Difference]: With dead ends: 219 [2022-11-02 20:25:18,696 INFO L226 Difference]: Without dead ends: 219 [2022-11-02 20:25:18,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-11-02 20:25:18,697 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 20 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:18,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1216 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 578 Invalid, 0 Unknown, 522 Unchecked, 4.4s Time] [2022-11-02 20:25:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-02 20:25:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-11-02 20:25:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:25:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2022-11-02 20:25:18,706 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 27 [2022-11-02 20:25:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:18,706 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2022-11-02 20:25:18,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2022-11-02 20:25:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:25:18,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:18,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:18,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:25:18,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:25:18,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:25:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2022-11-02 20:25:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:25:18,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156539420] [2022-11-02 20:25:18,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:25:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:25:18,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:25:18,927 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:25:18,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-02 20:25:19,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 20:25:19,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:25:19,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-02 20:25:19,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:25:19,558 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:25:19,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 20:25:19,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:19,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:25:19,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:19,891 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:19,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:19,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:20,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:20,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:20,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:20,481 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:20,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:20,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:20,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:20,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:25:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:20,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:25:21,460 WARN L833 $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_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_362) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2022-11-02 20:25:21,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_362) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse3) (bvadd (_ bv8 32) .cse0 .cse3))))))) is different from false [2022-11-02 20:25:21,629 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_362) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse3) (bvadd .cse0 .cse3 (_ bv12 32)))))))) is different from false [2022-11-02 20:25:21,729 WARN L833 $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_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_359))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_360) .cse0 v_ArrVal_361) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_362) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_359) c_create_data_~data~0.base) .cse1) v_ArrVal_361) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-02 20:25:21,808 WARN L833 $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$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_360) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_359) c_create_data_~data~0.base) .cse3) v_ArrVal_361) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_359))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_360) .cse4 v_ArrVal_361) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_362) c_create_data_~data~0.base) .cse3))))))))) is different from false [2022-11-02 20:25:21,920 WARN L833 $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$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_359))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_360) .cse1 v_ArrVal_361) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_362) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_360) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_359) c_create_data_~data~0.base) .cse2) v_ArrVal_361) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse5 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse3))))))) is different from false [2022-11-02 20:25:22,184 WARN L833 $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_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_357))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_359))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_358) .cse0 v_ArrVal_360) .cse1 v_ArrVal_361) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_362) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_357))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_358) .cse7 v_ArrVal_360) (select (select (store .cse8 .cse7 v_ArrVal_359) c_create_data_~data~0.base) .cse2) v_ArrVal_361))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse6 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2022-11-02 20:25:22,519 WARN L833 $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$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_357))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_359))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_358) .cse1 v_ArrVal_360) .cse2 v_ArrVal_361) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_362) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_357))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_358) .cse8 v_ArrVal_360) (select (select (store .cse9 .cse8 v_ArrVal_359) c_create_data_~data~0.base) .cse3) v_ArrVal_361))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse7 .cse4 (_ bv12 32)) (bvadd (_ bv16 32) .cse7 .cse4))))))) is different from false [2022-11-02 20:25:22,688 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_357))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_359))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_358) .cse1 v_ArrVal_360) .cse2 v_ArrVal_361) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_362) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_357))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_358) .cse7 v_ArrVal_360) (select (select (store .cse8 .cse7 v_ArrVal_359) c_create_data_~data~0.base) .cse3) v_ArrVal_361))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))))) is different from false [2022-11-02 20:25:22,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:22,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:22,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:22,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:22,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1130 treesize of output 968 [2022-11-02 20:25:22,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16636 treesize of output 15646 [2022-11-02 20:25:23,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15642 treesize of output 15098 [2022-11-02 20:25:23,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15098 treesize of output 14394 [2022-11-02 20:25:23,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14394 treesize of output 12074 [2022-11-02 20:25:23,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12074 treesize of output 10994 [2022-11-02 20:25:23,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10994 treesize of output 9874 [2022-11-02 20:25:26,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:26,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:26,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:26,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:26,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:25:26,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:26,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:25:26,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 720 treesize of output 618 [2022-11-02 20:25:26,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 614 treesize of output 566 [2022-11-02 20:25:26,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 566 treesize of output 454 [2022-11-02 20:25:26,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 454 treesize of output 422 [2022-11-02 20:25:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-11-02 20:25:26,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:25:26,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156539420] [2022-11-02 20:25:26,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156539420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:25:26,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:25:26,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2022-11-02 20:25:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176176424] [2022-11-02 20:25:26,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:25:26,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 20:25:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:25:26,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:25:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600 [2022-11-02 20:25:26,353 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 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) [2022-11-02 20:25:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:32,851 INFO L93 Difference]: Finished difference Result 229 states and 249 transitions. [2022-11-02 20:25:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:25:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 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 32 [2022-11-02 20:25:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:32,855 INFO L225 Difference]: With dead ends: 229 [2022-11-02 20:25:32,855 INFO L226 Difference]: Without dead ends: 229 [2022-11-02 20:25:32,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=110, Invalid=337, Unknown=9, NotChecked=414, Total=870 [2022-11-02 20:25:32,857 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 26 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 838 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:32,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1625 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 792 Invalid, 0 Unknown, 838 Unchecked, 5.0s Time] [2022-11-02 20:25:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-02 20:25:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2022-11-02 20:25:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 222 states have internal predecessors, (243), 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) [2022-11-02 20:25:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2022-11-02 20:25:32,866 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 32 [2022-11-02 20:25:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:32,866 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2022-11-02 20:25:32,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 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) [2022-11-02 20:25:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2022-11-02 20:25:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:25:32,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:32,868 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:32,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-02 20:25:33,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:25:33,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-02 20:25:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times [2022-11-02 20:25:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:25:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792668099] [2022-11-02 20:25:33,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:25:33,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:25:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:25:33,090 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:25:33,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16a3554e-1ec6-42a4-a1b3-43280f70e871/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-02 20:25:33,449 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:25:33,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:25:33,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:25:33,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:25:33,515 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:25:33,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 20:25:33,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:33,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:25:33,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:33,841 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:33,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:33,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:34,127 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:34,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:34,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:34,414 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:34,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:34,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:34,725 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:34,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:25:34,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:25:34,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:34,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:25:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:34,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:25:35,746 WARN L833 $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_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2022-11-02 20:25:35,812 WARN L833 $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$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_459) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_458) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_459) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2022-11-02 20:25:35,905 WARN L833 $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$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_459) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_458) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_459) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2022-11-02 20:25:36,210 WARN L833 $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_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) .cse0 v_ArrVal_459) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_458) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457) c_create_data_~data~0.base) .cse1) v_ArrVal_459) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-02 20:25:36,524 WARN L833 $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$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_457))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_456) .cse1 v_ArrVal_459) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_458) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_456) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_457) c_create_data_~data~0.base) .cse2) v_ArrVal_459) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-02 20:25:36,632 WARN L833 $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$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_456) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_457) c_create_data_~data~0.base) .cse3) v_ArrVal_459) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_457))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_456) .cse4 v_ArrVal_459) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_458) c_create_data_~data~0.base) .cse3))))))))) is different from false [2022-11-02 20:25:38,824 WARN L833 $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_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_457))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse0 v_ArrVal_456) .cse1 v_ArrVal_459) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_458) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse7 v_ArrVal_456) (select (select (store .cse8 .cse7 v_ArrVal_457) c_create_data_~data~0.base) .cse2) v_ArrVal_459))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse6 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2022-11-02 20:25:40,905 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (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$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_455))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_454) .cse3 v_ArrVal_456) (select (select (store .cse4 .cse3 v_ArrVal_457) c_create_data_~data~0.base) .cse5) v_ArrVal_459))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_455))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_457))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_454) .cse6 v_ArrVal_456) .cse7 v_ArrVal_459) c_create_data_~data~0.base) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_458) c_create_data_~data~0.base) .cse5))))))))))) is different from false [2022-11-02 20:25:41,157 WARN L833 $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$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_455))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_457))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_454) .cse1 v_ArrVal_456) .cse2 v_ArrVal_459) c_create_data_~data~0.base) .cse3) (_ bv20 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_455))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_454) .cse8 v_ArrVal_456) (select (select (store .cse9 .cse8 v_ArrVal_457) c_create_data_~data~0.base) .cse3) v_ArrVal_459))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse7 .cse4) (bvadd .cse7 (_ bv20 32) .cse4))))))) is different from false [2022-11-02 20:25:44,070 WARN L833 $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_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_452))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_455))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_453) .cse2 v_ArrVal_454) .cse3 v_ArrVal_456) (select (select (store .cse4 .cse3 v_ArrVal_457) c_create_data_~data~0.base) .cse5) v_ArrVal_459))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_452))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_455))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_457))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_453) .cse7 v_ArrVal_454) .cse8 v_ArrVal_456) .cse9 v_ArrVal_459) c_create_data_~data~0.base) .cse5) (_ bv20 32) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_458) c_create_data_~data~0.base) .cse5)))))))))))) is different from false [2022-11-02 20:25:48,106 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_452))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_455))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_453) .cse3 v_ArrVal_454) .cse4 v_ArrVal_456) (select (select (store .cse5 .cse4 v_ArrVal_457) c_create_data_~data~0.base) .cse6) v_ArrVal_459))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd (_ bv20 32) .cse0 .cse1)))) (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_452))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_455))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_457))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv20 32) .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_453) .cse8 v_ArrVal_454) .cse9 v_ArrVal_456) .cse10 v_ArrVal_459) c_create_data_~data~0.base) .cse6)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_458) c_create_data_~data~0.base) .cse6))))))))))))) is different from false [2022-11-02 20:25:48,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_452))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_455))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_453) .cse2 v_ArrVal_454) .cse3 v_ArrVal_456) (select (select (store .cse4 .cse3 v_ArrVal_457) c_create_data_~data~0.base) .cse5) v_ArrVal_459))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_452))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_455))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_457))) (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$.offset| .cse1 v_ArrVal_453) .cse7 v_ArrVal_454) .cse8 v_ArrVal_456) .cse9 v_ArrVal_459) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_458) c_create_data_~data~0.base) .cse5))))))))))))) is different from false [2022-11-02 20:25:49,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:49,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:49,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:49,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:25:49,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6748 treesize of output 5734 [2022-11-02 20:25:49,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1181734 treesize of output 1150072 [2022-11-02 20:25:57,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1150068 treesize of output 987644 [2022-11-02 20:26:01,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 987644 treesize of output 907068 [2022-11-02 20:26:04,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 907068 treesize of output 866324 [2022-11-02 20:26:08,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 866324 treesize of output 846324 [2022-11-02 20:26:12,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 846324 treesize of output 766460 [2022-11-02 20:26:15,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 766460 treesize of output 721052 [2022-11-02 20:26:19,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 721052 treesize of output 690812 [2022-11-02 20:26:41,064 WARN L234 SmtUtils]: Spent 17.78s on a formula simplification. DAG size of input: 1660 DAG size of output: 1660 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:27:14,879 WARN L234 SmtUtils]: Spent 30.42s on a formula simplification. DAG size of input: 1662 DAG size of output: 1662 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:27:31,505 WARN L234 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 1658 DAG size of output: 1658 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:27:46,889 WARN L234 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:27:59,855 WARN L234 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:28:06,589 WARN L234 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:28:23,285 WARN L234 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:28:29,646 WARN L234 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:28:44,454 WARN L234 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)