./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8 --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 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- 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-2329fc7 [2022-12-13 15:43:12,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:43:12,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:43:12,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:43:12,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:43:12,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:43:12,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:43:12,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:43:12,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:43:12,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:43:12,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:43:12,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:43:12,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:43:12,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:43:12,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:43:12,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:43:12,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:43:12,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:43:12,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:43:12,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:43:12,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:43:12,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:43:12,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:43:12,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:43:12,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:43:12,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:43:12,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:43:12,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:43:12,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:43:12,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:43:12,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:43:12,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:43:12,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:43:12,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:43:12,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:43:12,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:43:12,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:43:12,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:43:12,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:43:12,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:43:12,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:43:12,179 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 15:43:12,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:43:12,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:43:12,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:43:12,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:43:12,202 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:43:12,202 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:43:12,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:43:12,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:43:12,203 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:43:12,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:43:12,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:43:12,203 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:43:12,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:43:12,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:43:12,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:43:12,204 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:43:12,204 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:43:12,204 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:43:12,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:43:12,205 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:43:12,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:43:12,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:43:12,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:43:12,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:43:12,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:43:12,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:43:12,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:43:12,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:43:12,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:43:12,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:43:12,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:43:12,207 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:43:12,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:43:12,207 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:43:12,208 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/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_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2022-12-13 15:43:12,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:43:12,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:43:12,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:43:12,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:43:12,399 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:43:12,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2022-12-13 15:43:14,936 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:43:15,183 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:43:15,183 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2022-12-13 15:43:15,195 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data/a144d1771/73d77b6319f644afab54df7e83002631/FLAGb037c263a [2022-12-13 15:43:15,523 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data/a144d1771/73d77b6319f644afab54df7e83002631 [2022-12-13 15:43:15,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:43:15,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:43:15,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:43:15,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:43:15,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:43:15,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:43:15" (1/1) ... [2022-12-13 15:43:15,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6401b11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:15, skipping insertion in model container [2022-12-13 15:43:15,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:43:15" (1/1) ... [2022-12-13 15:43:15,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:43:15,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:43:15,802 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i[33021,33034] [2022-12-13 15:43:15,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:43:15,887 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-12-13 15:43:15,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d91d567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:15, skipping insertion in model container [2022-12-13 15:43:15,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:43:15,887 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 15:43:15,889 INFO L158 Benchmark]: Toolchain (without parser) took 358.00ms. Allocated memory is still 123.7MB. Free memory was 86.9MB in the beginning and 67.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 15:43:15,889 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory was 88.5MB in the beginning and 88.5MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:43:15,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.30ms. Allocated memory is still 123.7MB. Free memory was 86.4MB in the beginning and 67.1MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 15:43:15,890 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.12ms. Allocated memory is still 123.7MB. Free memory was 88.5MB in the beginning and 88.5MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.30ms. Allocated memory is still 123.7MB. Free memory was 86.4MB in the beginning and 67.1MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8 --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 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- 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-2329fc7 [2022-12-13 15:43:17,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:43:17,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:43:17,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:43:17,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:43:17,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:43:17,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:43:17,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:43:17,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:43:17,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:43:17,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:43:17,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:43:17,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:43:17,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:43:17,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:43:17,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:43:17,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:43:17,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:43:17,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:43:17,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:43:17,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:43:17,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:43:17,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:43:17,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:43:17,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:43:17,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:43:17,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:43:17,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:43:17,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:43:17,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:43:17,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:43:17,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:43:17,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:43:17,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:43:17,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:43:17,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:43:17,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:43:17,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:43:17,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:43:17,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:43:17,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:43:17,404 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 15:43:17,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:43:17,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:43:17,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:43:17,429 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:43:17,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:43:17,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:43:17,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:43:17,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:43:17,431 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:43:17,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:43:17,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:43:17,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:43:17,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:43:17,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:43:17,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:43:17,432 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:43:17,432 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:43:17,432 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:43:17,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:43:17,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:43:17,433 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 15:43:17,433 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 15:43:17,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:43:17,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:43:17,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:43:17,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:43:17,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:43:17,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:43:17,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:43:17,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:43:17,435 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 15:43:17,435 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 15:43:17,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:43:17,435 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:43:17,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:43:17,435 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 15:43:17,436 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:43:17,436 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/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_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2022-12-13 15:43:17,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:43:17,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:43:17,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:43:17,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:43:17,664 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:43:17,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2022-12-13 15:43:20,226 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:43:20,454 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:43:20,454 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2022-12-13 15:43:20,464 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data/438ecbbe3/d46e59226fca4d21a04d51e73fc686d1/FLAGed061f80d [2022-12-13 15:43:20,789 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/data/438ecbbe3/d46e59226fca4d21a04d51e73fc686d1 [2022-12-13 15:43:20,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:43:20,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:43:20,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:43:20,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:43:20,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:43:20,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:43:20" (1/1) ... [2022-12-13 15:43:20,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cbe3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:20, skipping insertion in model container [2022-12-13 15:43:20,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:43:20" (1/1) ... [2022-12-13 15:43:20,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:43:20,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:43:21,092 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i[33021,33034] [2022-12-13 15:43:21,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:43:21,193 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 15:43:21,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:43:21,223 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i[33021,33034] [2022-12-13 15:43:21,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:43:21,294 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:43:21,319 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i[33021,33034] [2022-12-13 15:43:21,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:43:21,391 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:43:21,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21 WrapperNode [2022-12-13 15:43:21,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:43:21,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:43:21,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:43:21,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:43:21,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,477 INFO L138 Inliner]: procedures = 180, calls = 349, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1158 [2022-12-13 15:43:21,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:43:21,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:43:21,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:43:21,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:43:21,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,546 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:43:21,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:43:21,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:43:21,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:43:21,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (1/1) ... [2022-12-13 15:43:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:43:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:43:21,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:43:21,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:43:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 15:43:21,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 15:43:21,607 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 15:43:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:43:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 15:43:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 15:43:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:43:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:43:21,788 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:43:21,790 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:43:21,793 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 15:43:25,952 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:43:25,968 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:43:25,968 INFO L300 CfgBuilder]: Removed 60 assume(true) statements. [2022-12-13 15:43:25,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:43:25 BoogieIcfgContainer [2022-12-13 15:43:25,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:43:25,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:43:25,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:43:25,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:43:25,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:43:20" (1/3) ... [2022-12-13 15:43:25,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464dc82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:43:25, skipping insertion in model container [2022-12-13 15:43:25,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:43:21" (2/3) ... [2022-12-13 15:43:25,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464dc82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:43:25, skipping insertion in model container [2022-12-13 15:43:25,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:43:25" (3/3) ... [2022-12-13 15:43:25,977 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2022-12-13 15:43:25,990 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:43:25,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2022-12-13 15:43:26,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:43:26,058 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=PETRI_NET, 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;@26067c67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:43:26,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2022-12-13 15:43:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 15:43:26,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:26,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 15:43:26,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-12-13 15:43:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:26,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226110318] [2022-12-13 15:43:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:26,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:26,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:26,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:26,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 15:43:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:26,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 15:43:26,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:26,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:26,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:26,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226110318] [2022-12-13 15:43:26,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226110318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:26,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:26,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:43:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686146243] [2022-12-13 15:43:26,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:26,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:43:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:26,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:43:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:43:26,275 INFO L87 Difference]: Start difference. First operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12-13 15:43:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:26,327 INFO L93 Difference]: Finished difference Result 1254 states and 1326 transitions. [2022-12-13 15:43:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:43:26,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12-13 15:43:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:26,347 INFO L225 Difference]: With dead ends: 1254 [2022-12-13 15:43:26,347 INFO L226 Difference]: Without dead ends: 1252 [2022-12-13 15:43:26,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:43:26,352 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:26,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:43:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-12-13 15:43:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2022-12-13 15:43:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 602 states have (on average 2.1461794019933556) internal successors, (1292), 1243 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1324 transitions. [2022-12-13 15:43:26,436 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1324 transitions. Word has length 5 [2022-12-13 15:43:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:26,436 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1324 transitions. [2022-12-13 15:43:26,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12-13 15:43:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1324 transitions. [2022-12-13 15:43:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 15:43:26,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:26,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 15:43:26,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:43:26,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:26,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-12-13 15:43:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:26,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337908811] [2022-12-13 15:43:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:26,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:26,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:26,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 15:43:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:26,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:43:26,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:26,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 15:43:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:26,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:26,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:26,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337908811] [2022-12-13 15:43:26,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337908811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:26,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:26,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:43:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303861592] [2022-12-13 15:43:26,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:26,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:43:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:43:26,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:43:26,884 INFO L87 Difference]: Start difference. First operand 1252 states and 1324 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-12-13 15:43:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:28,821 INFO L93 Difference]: Finished difference Result 1289 states and 1374 transitions. [2022-12-13 15:43:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:43:28,822 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-12-13 15:43:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:28,828 INFO L225 Difference]: With dead ends: 1289 [2022-12-13 15:43:28,828 INFO L226 Difference]: Without dead ends: 1289 [2022-12-13 15:43:28,829 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-12-13 15:43:28,829 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 1155 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:28,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 700 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 15:43:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-12-13 15:43:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1235. [2022-12-13 15:43:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 678 states have (on average 1.9675516224188792) internal successors, (1334), 1226 states have internal predecessors, (1334), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1366 transitions. [2022-12-13 15:43:28,846 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1366 transitions. Word has length 5 [2022-12-13 15:43:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:28,847 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1366 transitions. [2022-12-13 15:43:28,847 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-12-13 15:43:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1366 transitions. [2022-12-13 15:43:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 15:43:28,847 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:28,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 15:43:28,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 15:43:29,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:29,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-12-13 15:43:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041108746] [2022-12-13 15:43:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:29,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:29,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 15:43:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:29,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:43:29,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:29,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 15:43:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:29,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:29,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041108746] [2022-12-13 15:43:29,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041108746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:29,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:29,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:43:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832080454] [2022-12-13 15:43:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:43:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:43:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:43:29,212 INFO L87 Difference]: Start difference. First operand 1235 states and 1366 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-12-13 15:43:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:31,768 INFO L93 Difference]: Finished difference Result 1538 states and 1689 transitions. [2022-12-13 15:43:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:43:31,769 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-12-13 15:43:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:31,776 INFO L225 Difference]: With dead ends: 1538 [2022-12-13 15:43:31,776 INFO L226 Difference]: Without dead ends: 1538 [2022-12-13 15:43:31,777 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-12-13 15:43:31,777 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 504 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:31,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1475 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 15:43:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-12-13 15:43:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1391. [2022-12-13 15:43:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 844 states have (on average 1.9431279620853081) internal successors, (1640), 1382 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1672 transitions. [2022-12-13 15:43:31,806 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1672 transitions. Word has length 5 [2022-12-13 15:43:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:31,807 INFO L495 AbstractCegarLoop]: Abstraction has 1391 states and 1672 transitions. [2022-12-13 15:43:31,807 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-12-13 15:43:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1672 transitions. [2022-12-13 15:43:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 15:43:31,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:31,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 15:43:31,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 15:43:32,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:32,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-12-13 15:43:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:32,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233813983] [2022-12-13 15:43:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:32,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:32,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:32,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:32,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 15:43:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:32,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:43:32,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:32,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:32,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:32,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233813983] [2022-12-13 15:43:32,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233813983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:32,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:32,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:43:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169595695] [2022-12-13 15:43:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:32,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:43:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:32,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:43:32,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:43:32,083 INFO L87 Difference]: Start difference. First operand 1391 states and 1672 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-13 15:43:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:32,158 INFO L93 Difference]: Finished difference Result 2733 states and 3275 transitions. [2022-12-13 15:43:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:43:32,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-12-13 15:43:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:32,167 INFO L225 Difference]: With dead ends: 2733 [2022-12-13 15:43:32,168 INFO L226 Difference]: Without dead ends: 2733 [2022-12-13 15:43:32,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12-13 15:43:32,168 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 1139 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:32,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2714 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:43:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-12-13 15:43:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 1392. [2022-12-13 15:43:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 845 states have (on average 1.9420118343195267) internal successors, (1641), 1383 states have internal predecessors, (1641), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1673 transitions. [2022-12-13 15:43:32,222 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1673 transitions. Word has length 6 [2022-12-13 15:43:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:32,223 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1673 transitions. [2022-12-13 15:43:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-13 15:43:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1673 transitions. [2022-12-13 15:43:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 15:43:32,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:32,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:32,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 15:43:32,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:32,424 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:32,424 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-12-13 15:43:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:32,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129636249] [2022-12-13 15:43:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:32,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:32,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:32,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 15:43:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:32,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:43:32,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:32,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:32,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:32,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129636249] [2022-12-13 15:43:32,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129636249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:32,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:32,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:43:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460764928] [2022-12-13 15:43:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:32,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:43:32,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:32,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:43:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:43:32,535 INFO L87 Difference]: Start difference. First operand 1392 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 15:43:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:32,563 INFO L93 Difference]: Finished difference Result 1356 states and 1636 transitions. [2022-12-13 15:43:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:43:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-12-13 15:43:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:32,568 INFO L225 Difference]: With dead ends: 1356 [2022-12-13 15:43:32,568 INFO L226 Difference]: Without dead ends: 1356 [2022-12-13 15:43:32,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-12-13 15:43:32,569 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1133 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:32,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1206 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:43:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-12-13 15:43:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1350. [2022-12-13 15:43:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 827 states have (on average 1.932285368802902) internal successors, (1598), 1341 states have internal predecessors, (1598), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1630 transitions. [2022-12-13 15:43:32,595 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1630 transitions. Word has length 11 [2022-12-13 15:43:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:32,595 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1630 transitions. [2022-12-13 15:43:32,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 15:43:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1630 transitions. [2022-12-13 15:43:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 15:43:32,596 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:32,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:32,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 15:43:32,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:32,797 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-12-13 15:43:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:32,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001078332] [2022-12-13 15:43:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:32,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:32,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:32,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:32,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 15:43:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:32,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:43:32,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:32,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:32,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:32,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001078332] [2022-12-13 15:43:32,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001078332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:32,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:32,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:43:32,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454674349] [2022-12-13 15:43:32,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:32,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:43:32,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:32,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:43:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:43:32,919 INFO L87 Difference]: Start difference. First operand 1350 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 15:43:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:32,987 INFO L93 Difference]: Finished difference Result 1335 states and 1608 transitions. [2022-12-13 15:43:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:43:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-12-13 15:43:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:32,992 INFO L225 Difference]: With dead ends: 1335 [2022-12-13 15:43:32,992 INFO L226 Difference]: Without dead ends: 1335 [2022-12-13 15:43:32,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12-13 15:43:32,993 INFO L413 NwaCegarLoop]: 1128 mSDtfsCounter, 1114 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:32,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2282 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:43:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-12-13 15:43:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1328. [2022-12-13 15:43:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 819 states have (on average 1.9157509157509158) internal successors, (1569), 1319 states have internal predecessors, (1569), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1601 transitions. [2022-12-13 15:43:33,017 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1601 transitions. Word has length 13 [2022-12-13 15:43:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:33,017 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1601 transitions. [2022-12-13 15:43:33,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 15:43:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1601 transitions. [2022-12-13 15:43:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 15:43:33,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:33,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:33,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 15:43:33,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:33,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:33,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-12-13 15:43:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:33,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738596732] [2022-12-13 15:43:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:33,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:33,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 15:43:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:33,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:43:33,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:33,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 15:43:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:33,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:33,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:33,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738596732] [2022-12-13 15:43:33,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738596732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:33,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:33,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:43:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616398050] [2022-12-13 15:43:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:33,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:43:33,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:43:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:43:33,377 INFO L87 Difference]: Start difference. First operand 1328 states and 1601 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-12-13 15:43:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:36,159 INFO L93 Difference]: Finished difference Result 1788 states and 2048 transitions. [2022-12-13 15:43:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:43:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-12-13 15:43:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:36,166 INFO L225 Difference]: With dead ends: 1788 [2022-12-13 15:43:36,166 INFO L226 Difference]: Without dead ends: 1788 [2022-12-13 15:43:36,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-12-13 15:43:36,166 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 2384 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:36,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 1001 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-13 15:43:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-12-13 15:43:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1324. [2022-12-13 15:43:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 819 states have (on average 1.910866910866911) internal successors, (1565), 1315 states have internal predecessors, (1565), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1597 transitions. [2022-12-13 15:43:36,184 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1597 transitions. Word has length 27 [2022-12-13 15:43:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:36,184 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 1597 transitions. [2022-12-13 15:43:36,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-12-13 15:43:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1597 transitions. [2022-12-13 15:43:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 15:43:36,184 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:36,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:36,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 15:43:36,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:36,385 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-12-13 15:43:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:36,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219014777] [2022-12-13 15:43:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:36,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:36,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:36,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 15:43:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:36,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:43:36,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:36,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 15:43:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:36,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:36,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:36,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219014777] [2022-12-13 15:43:36,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219014777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:36,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:36,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:43:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805764991] [2022-12-13 15:43:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:36,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:43:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:43:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:43:36,652 INFO L87 Difference]: Start difference. First operand 1324 states and 1597 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-12-13 15:43:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:39,845 INFO L93 Difference]: Finished difference Result 1508 states and 1671 transitions. [2022-12-13 15:43:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:43:39,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-12-13 15:43:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:39,848 INFO L225 Difference]: With dead ends: 1508 [2022-12-13 15:43:39,848 INFO L226 Difference]: Without dead ends: 1508 [2022-12-13 15:43:39,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-12-13 15:43:39,848 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 851 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:39,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1911 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-13 15:43:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-12-13 15:43:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1320. [2022-12-13 15:43:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 819 states have (on average 1.9059829059829059) internal successors, (1561), 1311 states have internal predecessors, (1561), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1593 transitions. [2022-12-13 15:43:39,864 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1593 transitions. Word has length 27 [2022-12-13 15:43:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:39,864 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1593 transitions. [2022-12-13 15:43:39,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-12-13 15:43:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1593 transitions. [2022-12-13 15:43:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 15:43:39,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:39,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:39,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 15:43:40,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:40,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-12-13 15:43:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:40,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276136477] [2022-12-13 15:43:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:40,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:40,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:40,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 15:43:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:40,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:43:40,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:40,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:40,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:40,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276136477] [2022-12-13 15:43:40,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276136477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:40,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:40,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:43:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818503268] [2022-12-13 15:43:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:40,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:43:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:43:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:43:40,259 INFO L87 Difference]: Start difference. First operand 1320 states and 1593 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-12-13 15:43:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:40,301 INFO L93 Difference]: Finished difference Result 1320 states and 1589 transitions. [2022-12-13 15:43:40,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:43:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2022-12-13 15:43:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:40,304 INFO L225 Difference]: With dead ends: 1320 [2022-12-13 15:43:40,304 INFO L226 Difference]: Without dead ends: 1320 [2022-12-13 15:43:40,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-12-13 15:43:40,305 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 1083 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:40,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2260 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:43:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-12-13 15:43:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1314. [2022-12-13 15:43:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 813 states have (on average 1.9077490774907748) internal successors, (1551), 1305 states have internal predecessors, (1551), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1583 transitions. [2022-12-13 15:43:40,325 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1583 transitions. Word has length 42 [2022-12-13 15:43:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:40,325 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1583 transitions. [2022-12-13 15:43:40,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-12-13 15:43:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1583 transitions. [2022-12-13 15:43:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 15:43:40,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:40,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:40,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-13 15:43:40,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:40,528 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-12-13 15:43:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:40,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721677245] [2022-12-13 15:43:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:40,530 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:40,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 15:43:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:40,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:43:40,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:40,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:40,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:40,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721677245] [2022-12-13 15:43:40,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721677245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:40,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:40,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:43:40,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154705509] [2022-12-13 15:43:40,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:40,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:43:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:40,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:43:40,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:43:40,867 INFO L87 Difference]: Start difference. First operand 1314 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12-13 15:43:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:40,938 INFO L93 Difference]: Finished difference Result 1360 states and 1629 transitions. [2022-12-13 15:43:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:43:40,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2022-12-13 15:43:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:40,943 INFO L225 Difference]: With dead ends: 1360 [2022-12-13 15:43:40,943 INFO L226 Difference]: Without dead ends: 1360 [2022-12-13 15:43:40,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-12-13 15:43:40,944 INFO L413 NwaCegarLoop]: 1130 mSDtfsCounter, 67 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:40,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2165 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:43:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-12-13 15:43:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-12-13 15:43:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 859 states have (on average 1.859138533178114) internal successors, (1597), 1351 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1629 transitions. [2022-12-13 15:43:40,962 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1629 transitions. Word has length 50 [2022-12-13 15:43:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:40,962 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1629 transitions. [2022-12-13 15:43:40,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12-13 15:43:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1629 transitions. [2022-12-13 15:43:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 15:43:40,963 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:40,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:40,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-12-13 15:43:41,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:41,165 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-12-13 15:43:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:41,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915676710] [2022-12-13 15:43:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:41,167 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:41,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 15:43:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:41,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:43:41,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:41,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 15:43:41,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 15:43:41,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:43:41,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 15:43:41,804 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:43:41,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 15:43:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:41,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:41,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:41,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915676710] [2022-12-13 15:43:41,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915676710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:41,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:41,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:43:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123739364] [2022-12-13 15:43:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:41,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:43:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:43:41,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:43:41,822 INFO L87 Difference]: Start difference. First operand 1360 states and 1629 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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-12-13 15:43:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:44,143 INFO L93 Difference]: Finished difference Result 1329 states and 1552 transitions. [2022-12-13 15:43:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:43:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2022-12-13 15:43:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:44,149 INFO L225 Difference]: With dead ends: 1329 [2022-12-13 15:43:44,149 INFO L226 Difference]: Without dead ends: 1329 [2022-12-13 15:43:44,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:43:44,149 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1047 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:44,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 526 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-13 15:43:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-12-13 15:43:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1110. [2022-12-13 15:43:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 693 states have (on average 1.725829725829726) internal successors, (1196), 1101 states have internal predecessors, (1196), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1228 transitions. [2022-12-13 15:43:44,158 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1228 transitions. Word has length 53 [2022-12-13 15:43:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:44,158 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1228 transitions. [2022-12-13 15:43:44,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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-12-13 15:43:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1228 transitions. [2022-12-13 15:43:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 15:43:44,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:44,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:44,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 15:43:44,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:44,360 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-12-13 15:43:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:44,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275354121] [2022-12-13 15:43:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:44,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:44,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 15:43:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:44,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:43:44,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:44,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 15:43:44,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:43:44,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 15:43:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:44,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:44,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:44,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275354121] [2022-12-13 15:43:44,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275354121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:44,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:44,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:43:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812627169] [2022-12-13 15:43:44,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:44,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:43:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:43:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:43:44,581 INFO L87 Difference]: Start difference. First operand 1110 states and 1228 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-12-13 15:43:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:47,267 INFO L93 Difference]: Finished difference Result 1109 states and 1227 transitions. [2022-12-13 15:43:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:43:47,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2022-12-13 15:43:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:47,270 INFO L225 Difference]: With dead ends: 1109 [2022-12-13 15:43:47,270 INFO L226 Difference]: Without dead ends: 1109 [2022-12-13 15:43:47,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:43:47,270 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 4 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:47,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2633 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-13 15:43:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-12-13 15:43:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2022-12-13 15:43:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 693 states have (on average 1.7243867243867244) internal successors, (1195), 1100 states have internal predecessors, (1195), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1227 transitions. [2022-12-13 15:43:47,278 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1227 transitions. Word has length 58 [2022-12-13 15:43:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:47,278 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1227 transitions. [2022-12-13 15:43:47,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-12-13 15:43:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1227 transitions. [2022-12-13 15:43:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 15:43:47,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:47,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:47,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-12-13 15:43:47,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:47,480 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:47,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-12-13 15:43:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:47,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71192551] [2022-12-13 15:43:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:47,485 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:47,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 15:43:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:47,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 15:43:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:47,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 15:43:47,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:43:47,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:43:47,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-13 15:43:47,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 15:43:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:47,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:47,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:47,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71192551] [2022-12-13 15:43:47,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71192551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:47,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:47,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:43:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106582601] [2022-12-13 15:43:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:47,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:43:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:47,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:43:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:43:47,751 INFO L87 Difference]: Start difference. First operand 1109 states and 1227 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-12-13 15:43:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:50,824 INFO L93 Difference]: Finished difference Result 1108 states and 1226 transitions. [2022-12-13 15:43:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:43:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2022-12-13 15:43:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:50,827 INFO L225 Difference]: With dead ends: 1108 [2022-12-13 15:43:50,827 INFO L226 Difference]: Without dead ends: 1108 [2022-12-13 15:43:50,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:43:50,828 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 2 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:50,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2656 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 15:43:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-12-13 15:43:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2022-12-13 15:43:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 692 states have (on average 1.7254335260115607) internal successors, (1194), 1099 states have internal predecessors, (1194), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:43:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1226 transitions. [2022-12-13 15:43:50,836 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1226 transitions. Word has length 58 [2022-12-13 15:43:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:50,836 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1226 transitions. [2022-12-13 15:43:50,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-12-13 15:43:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1226 transitions. [2022-12-13 15:43:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 15:43:50,837 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:50,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:50,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 15:43:51,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:51,038 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2038939938, now seen corresponding path program 1 times [2022-12-13 15:43:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:51,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264257201] [2022-12-13 15:43:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:51,044 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:51,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-13 15:43:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:51,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:43:51,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:51,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:43:51,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:51,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264257201] [2022-12-13 15:43:51,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264257201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:43:51,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:43:51,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:43:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187228068] [2022-12-13 15:43:51,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:43:51,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:43:51,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:51,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:43:51,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:43:51,370 INFO L87 Difference]: Start difference. First operand 1108 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:43:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:51,413 INFO L93 Difference]: Finished difference Result 1111 states and 1231 transitions. [2022-12-13 15:43:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:43:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-12-13 15:43:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:51,416 INFO L225 Difference]: With dead ends: 1111 [2022-12-13 15:43:51,416 INFO L226 Difference]: Without dead ends: 1111 [2022-12-13 15:43:51,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-12-13 15:43:51,416 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 2 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:51,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3115 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:43:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-12-13 15:43:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-12-13 15:43:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 694 states have (on average 1.7247838616714697) internal successors, (1197), 1102 states have internal predecessors, (1197), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 15:43:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1231 transitions. [2022-12-13 15:43:51,426 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1231 transitions. Word has length 66 [2022-12-13 15:43:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:51,426 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1231 transitions. [2022-12-13 15:43:51,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:43:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1231 transitions. [2022-12-13 15:43:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:43:51,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:51,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:51,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-12-13 15:43:51,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:51,628 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2031497853, now seen corresponding path program 1 times [2022-12-13 15:43:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:51,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545909908] [2022-12-13 15:43:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:43:51,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:51,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:51,631 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:51,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-13 15:43:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:43:51,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:43:51,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:51,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:43:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:51,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:51,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545909908] [2022-12-13 15:43:51,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545909908] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:43:51,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:43:51,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-12-13 15:43:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064381850] [2022-12-13 15:43:51,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:43:51,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:43:51,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:51,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:43:51,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:43:51,916 INFO L87 Difference]: Start difference. First operand 1111 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:43:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:52,098 INFO L93 Difference]: Finished difference Result 1123 states and 1249 transitions. [2022-12-13 15:43:52,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:43:52,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-12-13 15:43:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:52,100 INFO L225 Difference]: With dead ends: 1123 [2022-12-13 15:43:52,100 INFO L226 Difference]: Without dead ends: 1123 [2022-12-13 15:43:52,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-13 15:43:52,101 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 9 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6213 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:52,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6213 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:43:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-12-13 15:43:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1121. [2022-12-13 15:43:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 703 states have (on average 1.7240398293029873) internal successors, (1212), 1111 states have internal predecessors, (1212), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 15:43:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1246 transitions. [2022-12-13 15:43:52,110 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1246 transitions. Word has length 67 [2022-12-13 15:43:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:52,110 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1246 transitions. [2022-12-13 15:43:52,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:43:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1246 transitions. [2022-12-13 15:43:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 15:43:52,111 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:52,111 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:52,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-12-13 15:43:52,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:52,312 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 942124702, now seen corresponding path program 2 times [2022-12-13 15:43:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:52,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66118570] [2022-12-13 15:43:52,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:43:52,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:52,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:52,318 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:52,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-13 15:43:52,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:43:52,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:43:52,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:43:52,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:52,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:43:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:52,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66118570] [2022-12-13 15:43:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66118570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:43:52,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:43:52,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-12-13 15:43:52,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993311629] [2022-12-13 15:43:52,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:43:52,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 15:43:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:52,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 15:43:52,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:43:52,870 INFO L87 Difference]: Start difference. First operand 1121 states and 1246 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:43:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:53,482 INFO L93 Difference]: Finished difference Result 1142 states and 1278 transitions. [2022-12-13 15:43:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 15:43:53,482 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-12-13 15:43:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:53,485 INFO L225 Difference]: With dead ends: 1142 [2022-12-13 15:43:53,486 INFO L226 Difference]: Without dead ends: 1138 [2022-12-13 15:43:53,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-12-13 15:43:53,486 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 23 mSDsluCounter, 6232 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7276 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:53,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7276 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 15:43:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-12-13 15:43:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1130. [2022-12-13 15:43:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 712 states have (on average 1.7191011235955056) internal successors, (1224), 1120 states have internal predecessors, (1224), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 15:43:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1258 transitions. [2022-12-13 15:43:53,499 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1258 transitions. Word has length 70 [2022-12-13 15:43:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:53,500 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1258 transitions. [2022-12-13 15:43:53,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:43:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1258 transitions. [2022-12-13 15:43:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 15:43:53,500 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:53,501 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:53,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-13 15:43:53,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:53,702 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:53,703 INFO L85 PathProgramCache]: Analyzing trace with hash -795487682, now seen corresponding path program 3 times [2022-12-13 15:43:53,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:53,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133191250] [2022-12-13 15:43:53,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:43:53,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:53,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:53,708 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:53,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-13 15:43:54,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 15:43:54,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:43:54,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 15:43:54,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:54,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:43:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:54,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:43:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133191250] [2022-12-13 15:43:54,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133191250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:43:54,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:43:54,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-12-13 15:43:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749681167] [2022-12-13 15:43:54,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:43:54,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 15:43:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:43:54,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 15:43:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-12-13 15:43:54,998 INFO L87 Difference]: Start difference. First operand 1130 states and 1258 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:43:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:43:58,187 INFO L93 Difference]: Finished difference Result 1172 states and 1334 transitions. [2022-12-13 15:43:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 15:43:58,188 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-12-13 15:43:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:43:58,190 INFO L225 Difference]: With dead ends: 1172 [2022-12-13 15:43:58,190 INFO L226 Difference]: Without dead ends: 1166 [2022-12-13 15:43:58,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 15:43:58,191 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 49 mSDsluCounter, 12504 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 13552 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:43:58,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 13552 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 15:43:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-12-13 15:43:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1148. [2022-12-13 15:43:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 730 states have (on average 1.7082191780821918) internal successors, (1247), 1138 states have internal predecessors, (1247), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 15:43:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1281 transitions. [2022-12-13 15:43:58,201 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1281 transitions. Word has length 76 [2022-12-13 15:43:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:43:58,201 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1281 transitions. [2022-12-13 15:43:58,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:43:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1281 transitions. [2022-12-13 15:43:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 15:43:58,202 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:43:58,202 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:43:58,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-12-13 15:43:58,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:58,404 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:43:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:43:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -944213634, now seen corresponding path program 4 times [2022-12-13 15:43:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:43:58,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756219607] [2022-12-13 15:43:58,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:43:58,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:43:58,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:43:58,410 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:43:58,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-13 15:43:58,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:43:58,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:43:58,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 15:43:58,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:43:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:43:58,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:44:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:44:00,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:44:00,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756219607] [2022-12-13 15:44:00,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756219607] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:44:00,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:44:00,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-12-13 15:44:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367228247] [2022-12-13 15:44:00,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:44:00,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 15:44:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:44:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 15:44:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 15:44:00,670 INFO L87 Difference]: Start difference. First operand 1148 states and 1281 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:44:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:44:10,314 INFO L93 Difference]: Finished difference Result 1228 states and 1414 transitions. [2022-12-13 15:44:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-12-13 15:44:10,315 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-12-13 15:44:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:44:10,319 INFO L225 Difference]: With dead ends: 1228 [2022-12-13 15:44:10,319 INFO L226 Difference]: Without dead ends: 1224 [2022-12-13 15:44:10,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-12-13 15:44:10,323 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 78 mSDsluCounter, 24293 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 25354 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:44:10,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 25354 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 15:44:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-12-13 15:44:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1182. [2022-12-13 15:44:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 764 states have (on average 1.692408376963351) internal successors, (1293), 1172 states have internal predecessors, (1293), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 15:44:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1327 transitions. [2022-12-13 15:44:10,341 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1327 transitions. Word has length 88 [2022-12-13 15:44:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:44:10,341 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1327 transitions. [2022-12-13 15:44:10,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:44:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1327 transitions. [2022-12-13 15:44:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 15:44:10,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:44:10,342 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:44:10,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-13 15:44:10,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:44:10,543 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:44:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:44:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1478038498, now seen corresponding path program 5 times [2022-12-13 15:44:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:44:10,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628467804] [2022-12-13 15:44:10,546 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:44:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:44:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:44:10,549 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:44:10,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-12-13 15:44:11,908 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 15:44:11,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:44:11,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 15:44:11,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:44:11,962 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 15:44:11,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2022-12-13 15:44:12,223 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-13 15:44:12,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-13 15:44:12,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:44:12,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-12-13 15:44:12,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1564)))) is different from true [2022-12-13 15:44:13,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1581)))) is different from true [2022-12-13 15:44:13,458 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1589)))) is different from true [2022-12-13 15:44:13,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1603)))) is different from true [2022-12-13 15:44:13,972 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:44:13,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-13 15:44:14,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2022-12-13 15:44:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-12-13 15:44:14,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:44:16,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:44:16,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628467804] [2022-12-13 15:44:16,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628467804] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:44:16,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2080482281] [2022-12-13 15:44:16,421 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:44:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:44:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:44:16,422 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:44:16,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-12-13 15:45:20,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 15:45:20,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:45:21,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 15:45:21,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:45:21,059 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 15:45:21,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 15:45:21,317 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-13 15:45:21,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-12-13 15:45:21,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-13 15:45:21,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-12-13 15:45:24,606 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:45:24,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 15:45:24,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-12-13 15:45:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-13 15:45:24,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:45:27,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2080482281] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:45:27,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:45:27,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 20 [2022-12-13 15:45:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799207223] [2022-12-13 15:45:27,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:45:27,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 15:45:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:45:27,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 15:45:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=336, Unknown=30, NotChecked=164, Total=600 [2022-12-13 15:45:27,030 INFO L87 Difference]: Start difference. First operand 1182 states and 1327 transitions. Second operand has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 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-12-13 15:45:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:45:48,115 INFO L93 Difference]: Finished difference Result 2281 states and 2468 transitions. [2022-12-13 15:45:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 15:45:48,116 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 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) Word has length 110 [2022-12-13 15:45:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:45:48,122 INFO L225 Difference]: With dead ends: 2281 [2022-12-13 15:45:48,122 INFO L226 Difference]: Without dead ends: 2273 [2022-12-13 15:45:48,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 118 SyntacticMatches, 87 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=256, Invalid=1238, Unknown=82, NotChecked=316, Total=1892 [2022-12-13 15:45:48,123 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 4479 mSDsluCounter, 5051 mSDsCounter, 0 mSdLazyCounter, 6596 mSolverCounterSat, 168 mSolverCounterUnsat, 2012 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4479 SdHoareTripleChecker+Valid, 5566 SdHoareTripleChecker+Invalid, 17086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 6596 IncrementalHoareTripleChecker+Invalid, 2012 IncrementalHoareTripleChecker+Unknown, 8310 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2022-12-13 15:45:48,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4479 Valid, 5566 Invalid, 17086 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [168 Valid, 6596 Invalid, 2012 Unknown, 8310 Unchecked, 19.9s Time] [2022-12-13 15:45:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2022-12-13 15:45:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1230. [2022-12-13 15:45:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 812 states have (on average 1.6514778325123152) internal successors, (1341), 1219 states have internal predecessors, (1341), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 15:45:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1375 transitions. [2022-12-13 15:45:48,137 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1375 transitions. Word has length 110 [2022-12-13 15:45:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:45:48,137 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1375 transitions. [2022-12-13 15:45:48,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 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-12-13 15:45:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1375 transitions. [2022-12-13 15:45:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 15:45:48,138 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:45:48,138 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:45:48,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-12-13 15:45:48,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-12-13 15:45:48,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 15:45:48,539 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 15:45:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:45:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1478038497, now seen corresponding path program 1 times [2022-12-13 15:45:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:45:48,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786605155] [2022-12-13 15:45:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:45:48,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:45:48,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:45:48,548 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:45:48,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-13 15:45:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:45:49,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-12-13 15:45:49,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:45:49,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 15:45:49,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 15:45:49,411 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:45:49,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 15:45:49,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:45:49,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:45:49,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-12-13 15:45:49,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 15:45:49,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459)))) is different from true [2022-12-13 15:45:49,611 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461)))) is different from true [2022-12-13 15:45:49,622 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463)))) is different from true [2022-12-13 15:45:49,633 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-12-13 15:45:49,644 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467)))) is different from true [2022-12-13 15:45:49,656 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:49,695 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472)))) is different from true [2022-12-13 15:45:49,706 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:49,716 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476)))) is different from true [2022-12-13 15:45:49,727 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-12-13 15:45:49,739 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:49,750 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:45:49,761 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-12-13 15:45:49,800 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489)))) is different from true [2022-12-13 15:45:49,862 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-12-13 15:45:49,871 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:45:49,885 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:45:49,894 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-12-13 15:45:49,903 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-12-13 15:45:49,913 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504)))) is different from true [2022-12-13 15:45:49,921 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:49,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:49,939 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-12-13 15:45:49,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-12-13 15:45:49,956 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:49,965 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516)))) is different from true [2022-12-13 15:45:49,973 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-12-13 15:45:49,981 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520)))) is different from true [2022-12-13 15:45:49,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:49,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524)))) is different from true [2022-12-13 15:45:50,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:45:50,015 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:45:50,024 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-12-13 15:45:50,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-12-13 15:45:50,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-12-13 15:45:50,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-12-13 15:45:50,062 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538)))) is different from true [2022-12-13 15:45:50,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:45:50,079 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542)))) is different from true [2022-12-13 15:45:50,107 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:45:50,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 15:45:50,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 15:45:50,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 15:45:50,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 15:45:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-12-13 15:45:50,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:45:50,937 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 15:45:50,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:45:50,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786605155] [2022-12-13 15:45:50,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786605155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:45:50,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [928194040] [2022-12-13 15:45:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:45:50,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:45:50,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:45:50,943 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:45:50,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c9a9f41-5616-4d73-ad2c-03ad2df2e280/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-12-13 15:47:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:33,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-12-13 15:47:33,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:47:33,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 15:47:33,541 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:47:33,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 15:47:33,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 15:47:33,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:47:33,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 15:47:33,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 15:47:33,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-13 15:47:33,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2995) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:47:33,780 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2997))) (exists ((v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2996)))) is different from true [2022-12-13 15:47:33,792 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2998))) (exists ((v_ArrVal_2999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2999)))) is different from true [2022-12-13 15:47:33,803 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000)))) is different from true [2022-12-13 15:47:33,813 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:47:33,853 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007)))) is different from true [2022-12-13 15:47:33,864 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008)))) is different from true [2022-12-13 15:47:33,874 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3011))) (exists ((v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3010)))) is different from true [2022-12-13 15:47:33,884 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3012))) (exists ((v_ArrVal_3013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3013)))) is different from true [2022-12-13 15:47:33,894 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3015))) (exists ((v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3014)))) is different from true [2022-12-13 15:47:33,906 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3017))) (exists ((v_ArrVal_3016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3016)))) is different from true [2022-12-13 15:47:33,916 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3019) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3018)))) is different from true [2022-12-13 15:47:33,927 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3020))) (exists ((v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3021)))) is different from true [2022-12-13 15:47:33,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3023) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3022)))) is different from true [2022-12-13 15:47:33,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3024) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3025)))) is different from true [2022-12-13 15:47:33,958 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3026) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3027) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:47:33,968 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3029) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:47:33,978 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3030))) (exists ((v_ArrVal_3031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3031) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:47:33,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3032) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3033)))) is different from true [2022-12-13 15:47:34,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034)))) is different from true [2022-12-13 15:47:34,011 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3037)))) is different from true [2022-12-13 15:47:34,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:47:34,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:47:34,045 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043)))) is different from true [2022-12-13 15:47:34,057 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044)))) is different from true [2022-12-13 15:47:34,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047)))) is different from true [2022-12-13 15:47:34,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-12-13 15:47:34,092 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050)))) is different from true [2022-12-13 15:47:34,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053)))) is different from true [2022-12-13 15:47:34,114 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055)))) is different from true [2022-12-13 15:47:34,125 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:47:34,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3059))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058)))) is different from true [2022-12-13 15:47:34,148 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060)))) is different from true [2022-12-13 15:47:34,159 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3062))) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063)))) is different from true [2022-12-13 15:47:34,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064)))) is different from true [2022-12-13 15:47:34,181 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:47:34,193 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:47:34,204 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070)))) is different from true [2022-12-13 15:47:34,221 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072)))) is different from true [2022-12-13 15:47:34,230 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074)))) is different from true [2022-12-13 15:47:34,239 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3077 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3077) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3076 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3076) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:47:34,248 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078)))) is different from true [2022-12-13 15:47:34,259 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081)))) is different from true [2022-12-13 15:47:34,292 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:47:34,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 15:47:34,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 15:47:34,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-13 15:47:34,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 15:47:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-12-13 15:47:34,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:47:34,940 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-12-13 15:47:34,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [928194040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:47:34,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:47:34,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 51] total 94 [2022-12-13 15:47:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365590799] [2022-12-13 15:47:34,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:47:34,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-12-13 15:47:34,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:47:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-12-13 15:47:34,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=246, Unknown=93, NotChecked=9156, Total=9702 [2022-12-13 15:47:34,947 INFO L87 Difference]: Start difference. First operand 1230 states and 1375 transitions. Second operand has 95 states, 92 states have (on average 2.2934782608695654) internal successors, (211), 95 states have internal predecessors, (211), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:47:35,862 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2997))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2996))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-12-13 15:47:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:47:48,918 INFO L93 Difference]: Finished difference Result 1627 states and 1742 transitions. [2022-12-13 15:47:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 15:47:48,919 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 92 states have (on average 2.2934782608695654) internal successors, (211), 95 states have internal predecessors, (211), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-12-13 15:47:48,919 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-12-13 15:47:48,919 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 92 states have (on average 2.2934782608695654) internal successors, (211), 95 states have internal predecessors, (211), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110