./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- 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 19:46:57,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:46:57,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:46:57,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:46:57,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:46:57,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:46:57,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:46:57,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:46:57,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:46:57,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:46:57,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:46:57,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:46:57,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:46:57,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:46:57,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:46:57,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:46:57,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:46:57,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:46:57,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:46:57,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:46:57,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:46:57,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:46:57,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:46:57,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:46:57,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:46:57,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:46:57,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:46:57,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:46:57,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:46:57,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:46:57,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:46:57,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:46:57,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:46:57,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:46:57,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:46:57,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:46:57,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:46:57,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:46:57,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:46:57,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:46:57,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:46:57,917 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 19:46:57,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:46:57,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:46:57,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:46:57,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:46:57,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:46:57,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:46:57,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:46:57,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:46:57,933 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:46:57,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:46:57,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:46:57,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:46:57,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:46:57,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:46:57,935 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:46:57,936 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2022-12-13 19:46:58,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:46:58,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:46:58,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:46:58,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:46:58,158 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:46:58,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-12-13 19:47:00,820 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:47:01,058 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:47:01,058 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-12-13 19:47:01,074 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data/6c959e4a1/9f3a16286ca14e9fbbff4e9eeafa40d0/FLAG7741eebfb [2022-12-13 19:47:01,085 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data/6c959e4a1/9f3a16286ca14e9fbbff4e9eeafa40d0 [2022-12-13 19:47:01,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:47:01,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:47:01,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:47:01,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:47:01,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:47:01,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:01" (1/1) ... [2022-12-13 19:47:01,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3632ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:01, skipping insertion in model container [2022-12-13 19:47:01,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:01" (1/1) ... [2022-12-13 19:47:01,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:47:01,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:47:01,543 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-12-13 19:47:01,555 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-12-13 19:47:01,558 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 19:47:01,642 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-12-13 19:47:01,644 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-12-13 19:47:01,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:47:01,663 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 19:47:01,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1fa2b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:01, skipping insertion in model container [2022-12-13 19:47:01,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:47:01,664 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 19:47:01,666 INFO L158 Benchmark]: Toolchain (without parser) took 576.31ms. Allocated memory is still 138.4MB. Free memory was 98.4MB in the beginning and 77.0MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 19:47:01,666 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:47:01,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.13ms. Allocated memory is still 138.4MB. Free memory was 98.0MB in the beginning and 77.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 19:47:01,668 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.20ms. Allocated memory is still 138.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.13ms. Allocated memory is still 138.4MB. Free memory was 98.0MB in the beginning and 77.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- 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 19:47:03,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:47:03,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:47:03,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:47:03,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:47:03,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:47:03,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:47:03,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:47:03,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:47:03,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:47:03,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:47:03,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:47:03,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:47:03,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:47:03,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:47:03,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:47:03,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:47:03,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:47:03,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:47:03,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:47:03,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:47:03,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:47:03,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:47:03,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:47:03,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:47:03,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:47:03,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:47:03,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:47:03,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:47:03,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:47:03,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:47:03,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:47:03,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:47:03,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:47:03,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:47:03,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:47:03,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:47:03,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:47:03,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:47:03,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:47:03,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:47:03,117 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 19:47:03,135 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:47:03,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:47:03,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:47:03,136 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:47:03,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:47:03,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:47:03,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:47:03,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:47:03,137 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:47:03,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:47:03,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:47:03,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:47:03,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:47:03,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:47:03,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:47:03,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:47:03,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:47:03,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:47:03,139 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 19:47:03,140 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:47:03,140 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2022-12-13 19:47:03,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:47:03,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:47:03,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:47:03,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:47:03,405 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:47:03,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-12-13 19:47:05,954 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:47:06,189 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:47:06,189 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-12-13 19:47:06,204 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data/394c59a8a/4445bde676d3404285c13ad768327df2/FLAG9c5c441d7 [2022-12-13 19:47:06,218 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/data/394c59a8a/4445bde676d3404285c13ad768327df2 [2022-12-13 19:47:06,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:47:06,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:47:06,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:47:06,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:47:06,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:47:06,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:06,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f0d3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06, skipping insertion in model container [2022-12-13 19:47:06,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:06,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:47:06,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:47:06,652 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-12-13 19:47:06,662 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-12-13 19:47:06,664 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 19:47:06,722 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-12-13 19:47:06,723 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-12-13 19:47:06,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:47:06,736 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 19:47:06,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:47:06,767 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-12-13 19:47:06,768 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-12-13 19:47:06,769 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 19:47:06,811 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-12-13 19:47:06,812 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-12-13 19:47:06,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:47:06,817 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:47:06,837 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-12-13 19:47:06,838 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-12-13 19:47:06,839 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 19:47:06,869 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-12-13 19:47:06,870 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_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-12-13 19:47:06,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:47:06,909 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:47:06,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06 WrapperNode [2022-12-13 19:47:06,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:47:06,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:47:06,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:47:06,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:47:06,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:06,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:06,970 INFO L138 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1038 [2022-12-13 19:47:06,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:47:06,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:47:06,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:47:06,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:47:06,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:06,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:06,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:06,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:07,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:07,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:07,020 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:07,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:07,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:47:07,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:47:07,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:47:07,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:47:07,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (1/1) ... [2022-12-13 19:47:07,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:47:07,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:47:07,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:47:07,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:47:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 19:47:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-12-13 19:47:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-12-13 19:47:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 19:47:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 19:47:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:47:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:47:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-12-13 19:47:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-12-13 19:47:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 19:47:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-12-13 19:47:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-12-13 19:47:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:47:07,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:47:07,279 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:47:07,280 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:47:10,782 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:47:10,792 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:47:10,792 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-12-13 19:47:10,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:47:10 BoogieIcfgContainer [2022-12-13 19:47:10,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:47:10,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:47:10,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:47:10,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:47:10,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:47:06" (1/3) ... [2022-12-13 19:47:10,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70179c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:47:10, skipping insertion in model container [2022-12-13 19:47:10,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:06" (2/3) ... [2022-12-13 19:47:10,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70179c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:47:10, skipping insertion in model container [2022-12-13 19:47:10,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:47:10" (3/3) ... [2022-12-13 19:47:10,800 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2022-12-13 19:47:10,814 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:47:10,814 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2022-12-13 19:47:10,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:47:10,861 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;@a95e14e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:47:10,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2022-12-13 19:47:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 19:47:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 19:47:10,871 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:10,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 19:47:10,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-12-13 19:47:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:10,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754513233] [2022-12-13 19:47:10,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:10,885 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 19:47:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:10,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:10,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:10,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 19:47:11,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:11,056 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 19:47:11,068 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 19:47:11,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:11,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:11,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754513233] [2022-12-13 19:47:11,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754513233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:11,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:11,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:47:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243083523] [2022-12-13 19:47:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:11,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:47:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:11,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:11,107 INFO L87 Difference]: Start difference. First operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:47:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:12,591 INFO L93 Difference]: Finished difference Result 1161 states and 1227 transitions. [2022-12-13 19:47:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:12,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-12-13 19:47:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:12,604 INFO L225 Difference]: With dead ends: 1161 [2022-12-13 19:47:12,604 INFO L226 Difference]: Without dead ends: 1159 [2022-12-13 19:47:12,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:12,607 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 714 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:12,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1040 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 19:47:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-12-13 19:47:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1102. [2022-12-13 19:47:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 567 states have (on average 2.0846560846560847) internal successors, (1182), 1085 states have internal predecessors, (1182), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:47:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1208 transitions. [2022-12-13 19:47:12,660 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1208 transitions. Word has length 3 [2022-12-13 19:47:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:12,660 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1208 transitions. [2022-12-13 19:47:12,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:47:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1208 transitions. [2022-12-13 19:47:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 19:47:12,666 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:12,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 19:47:12,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:12,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:12,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-12-13 19:47:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:12,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378602953] [2022-12-13 19:47:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:12,873 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 19:47:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:12,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:12,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:13,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:47:13,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:13,046 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 19:47:13,056 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 19:47:13,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:13,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:13,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378602953] [2022-12-13 19:47:13,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378602953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:13,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:13,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:47:13,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786784465] [2022-12-13 19:47:13,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:13,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:47:13,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:13,059 INFO L87 Difference]: Start difference. First operand 1102 states and 1208 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:47:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:15,505 INFO L93 Difference]: Finished difference Result 1496 states and 1636 transitions. [2022-12-13 19:47:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-12-13 19:47:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:15,509 INFO L225 Difference]: With dead ends: 1496 [2022-12-13 19:47:15,509 INFO L226 Difference]: Without dead ends: 1496 [2022-12-13 19:47:15,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:15,510 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 418 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:15,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1534 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-13 19:47:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-12-13 19:47:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1306. [2022-12-13 19:47:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 770 states have (on average 2.07012987012987) internal successors, (1594), 1287 states have internal predecessors, (1594), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 19:47:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1624 transitions. [2022-12-13 19:47:15,533 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1624 transitions. Word has length 3 [2022-12-13 19:47:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:15,533 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1624 transitions. [2022-12-13 19:47:15,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:47:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1624 transitions. [2022-12-13 19:47:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 19:47:15,533 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:15,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:15,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:15,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:15,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-12-13 19:47:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:15,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792286728] [2022-12-13 19:47:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:15,741 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 19:47:15,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:15,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:15,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:15,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:47:15,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:15,880 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 19:47:15,885 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 19:47:15,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:15,929 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 19:47:15,942 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:15,943 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 19:47:15,965 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 19:47:15,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:15,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792286728] [2022-12-13 19:47:15,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792286728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:15,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:15,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14322590] [2022-12-13 19:47:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:15,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:47:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:47:15,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:47:15,967 INFO L87 Difference]: Start difference. First operand 1306 states and 1624 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 19:47:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:19,919 INFO L93 Difference]: Finished difference Result 1996 states and 2369 transitions. [2022-12-13 19:47:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:47:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-12-13 19:47:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:19,924 INFO L225 Difference]: With dead ends: 1996 [2022-12-13 19:47:19,924 INFO L226 Difference]: Without dead ends: 1996 [2022-12-13 19:47:19,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 19:47:19,925 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 718 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:19,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1581 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-12-13 19:47:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2022-12-13 19:47:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1451. [2022-12-13 19:47:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 915 states have (on average 2.0513661202185793) internal successors, (1877), 1432 states have internal predecessors, (1877), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 19:47:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1907 transitions. [2022-12-13 19:47:19,945 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1907 transitions. Word has length 8 [2022-12-13 19:47:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:19,945 INFO L495 AbstractCegarLoop]: Abstraction has 1451 states and 1907 transitions. [2022-12-13 19:47:19,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 19:47:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1907 transitions. [2022-12-13 19:47:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 19:47:19,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:19,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:19,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:20,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:20,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:20,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:20,149 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-12-13 19:47:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:20,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940560432] [2022-12-13 19:47:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:20,152 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 19:47:20,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:20,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:20,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:20,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:47:20,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:20,307 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 19:47:20,321 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 19:47:20,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:20,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:20,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940560432] [2022-12-13 19:47:20,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940560432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:20,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:20,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275972872] [2022-12-13 19:47:20,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:20,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:47:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:47:20,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:47:20,323 INFO L87 Difference]: Start difference. First operand 1451 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 19:47:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:22,853 INFO L93 Difference]: Finished difference Result 2429 states and 3105 transitions. [2022-12-13 19:47:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:47:22,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-12-13 19:47:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:22,859 INFO L225 Difference]: With dead ends: 2429 [2022-12-13 19:47:22,859 INFO L226 Difference]: Without dead ends: 2429 [2022-12-13 19:47:22,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 19:47:22,859 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2139 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:22,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1969 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 19:47:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-12-13 19:47:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1406. [2022-12-13 19:47:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 915 states have (on average 1.9868852459016393) internal successors, (1818), 1387 states have internal predecessors, (1818), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 19:47:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1848 transitions. [2022-12-13 19:47:22,880 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1848 transitions. Word has length 9 [2022-12-13 19:47:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:22,881 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1848 transitions. [2022-12-13 19:47:22,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 19:47:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1848 transitions. [2022-12-13 19:47:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 19:47:22,881 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:22,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:22,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:23,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:23,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-12-13 19:47:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:23,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806709588] [2022-12-13 19:47:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:23,083 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 19:47:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:23,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:23,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:23,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:47:23,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:23,183 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 19:47:23,218 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 19:47:23,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:23,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:23,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806709588] [2022-12-13 19:47:23,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806709588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:23,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:23,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:23,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834610501] [2022-12-13 19:47:23,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:23,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:47:23,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:23,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:47:23,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:47:23,220 INFO L87 Difference]: Start difference. First operand 1406 states and 1848 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 19:47:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:26,315 INFO L93 Difference]: Finished difference Result 2045 states and 2683 transitions. [2022-12-13 19:47:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:47:26,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-12-13 19:47:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:26,320 INFO L225 Difference]: With dead ends: 2045 [2022-12-13 19:47:26,320 INFO L226 Difference]: Without dead ends: 2045 [2022-12-13 19:47:26,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 19:47:26,321 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 1375 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:26,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2090 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 19:47:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-12-13 19:47:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1396. [2022-12-13 19:47:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 915 states have (on average 1.960655737704918) internal successors, (1794), 1377 states have internal predecessors, (1794), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 19:47:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1824 transitions. [2022-12-13 19:47:26,341 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1824 transitions. Word has length 9 [2022-12-13 19:47:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:26,341 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 1824 transitions. [2022-12-13 19:47:26,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 19:47:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1824 transitions. [2022-12-13 19:47:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 19:47:26,342 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:26,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:26,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:26,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:26,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-12-13 19:47:26,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:26,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73443545] [2022-12-13 19:47:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:26,548 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 19:47:26,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:26,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:26,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:26,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:47:26,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:26,723 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 19:47:26,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:26,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:26,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73443545] [2022-12-13 19:47:26,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73443545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:26,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:26,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:26,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221924086] [2022-12-13 19:47:26,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:26,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:47:26,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:47:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:47:26,725 INFO L87 Difference]: Start difference. First operand 1396 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 19:47:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:27,319 INFO L93 Difference]: Finished difference Result 1872 states and 2391 transitions. [2022-12-13 19:47:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:47:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 19:47:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:27,322 INFO L225 Difference]: With dead ends: 1872 [2022-12-13 19:47:27,322 INFO L226 Difference]: Without dead ends: 1872 [2022-12-13 19:47:27,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 19:47:27,323 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 546 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:27,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 3116 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 19:47:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-12-13 19:47:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1647. [2022-12-13 19:47:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1166 states have (on average 1.9742710120068612) internal successors, (2302), 1628 states have internal predecessors, (2302), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 19:47:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2332 transitions. [2022-12-13 19:47:27,343 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2332 transitions. Word has length 11 [2022-12-13 19:47:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:27,343 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2332 transitions. [2022-12-13 19:47:27,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 19:47:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2332 transitions. [2022-12-13 19:47:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 19:47:27,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:27,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:27,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Forceful destruction successful, exit code 0 [2022-12-13 19:47:27,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:27,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1297880888, now seen corresponding path program 1 times [2022-12-13 19:47:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:27,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471535339] [2022-12-13 19:47:27,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:27,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 19:47:27,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:27,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:27,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:27,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:47:27,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:27,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:47:27,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:47:27,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:47:27,672 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 30 treesize of output 39 [2022-12-13 19:47:27,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:47:27,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-12-13 19:47:27,720 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 19:47:27,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:27,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:27,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471535339] [2022-12-13 19:47:27,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471535339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:27,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:27,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900907480] [2022-12-13 19:47:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:27,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:47:27,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:47:27,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:47:27,722 INFO L87 Difference]: Start difference. First operand 1647 states and 2332 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:29,104 INFO L93 Difference]: Finished difference Result 1653 states and 2035 transitions. [2022-12-13 19:47:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:47:29,106 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 19:47:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:29,109 INFO L225 Difference]: With dead ends: 1653 [2022-12-13 19:47:29,109 INFO L226 Difference]: Without dead ends: 1653 [2022-12-13 19:47:29,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 19:47:29,110 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 358 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:29,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 2971 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 19:47:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-12-13 19:47:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1289. [2022-12-13 19:47:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 810 states have (on average 1.9506172839506173) internal successors, (1580), 1272 states have internal predecessors, (1580), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:47:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1606 transitions. [2022-12-13 19:47:29,123 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1606 transitions. Word has length 14 [2022-12-13 19:47:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:29,123 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1606 transitions. [2022-12-13 19:47:29,123 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1606 transitions. [2022-12-13 19:47:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 19:47:29,124 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:29,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:29,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:29,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:29,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-12-13 19:47:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:29,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85559827] [2022-12-13 19:47:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:29,326 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 19:47:29,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:29,326 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:29,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:29,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 19:47:29,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:29,462 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 19:47:29,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:29,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:29,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85559827] [2022-12-13 19:47:29,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85559827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:29,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:29,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637535061] [2022-12-13 19:47:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:29,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:47:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:29,464 INFO L87 Difference]: Start difference. First operand 1289 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19:47:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:29,484 INFO L93 Difference]: Finished difference Result 1229 states and 1520 transitions. [2022-12-13 19:47:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:29,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-12-13 19:47:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:29,487 INFO L225 Difference]: With dead ends: 1229 [2022-12-13 19:47:29,487 INFO L226 Difference]: Without dead ends: 1229 [2022-12-13 19:47:29,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 19:47:29,488 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 957 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1094 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 19:47:29,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1094 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:47:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-12-13 19:47:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2022-12-13 19:47:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 774 states have (on average 1.930232558139535) internal successors, (1494), 1212 states have internal predecessors, (1494), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:47:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1520 transitions. [2022-12-13 19:47:29,499 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1520 transitions. Word has length 19 [2022-12-13 19:47:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:29,500 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1520 transitions. [2022-12-13 19:47:29,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19:47:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1520 transitions. [2022-12-13 19:47:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 19:47:29,500 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:29,500 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] [2022-12-13 19:47:29,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Forceful destruction successful, exit code 0 [2022-12-13 19:47:29,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:29,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-12-13 19:47:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545630873] [2022-12-13 19:47:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:29,703 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 19:47:29,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:29,705 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:29,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:29,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 19:47:29,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:29,985 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 19:47:29,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:29,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545630873] [2022-12-13 19:47:29,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545630873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:29,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:29,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426697276] [2022-12-13 19:47:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:47:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:47:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:47:29,987 INFO L87 Difference]: Start difference. First operand 1229 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 19:47:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:30,031 INFO L93 Difference]: Finished difference Result 1201 states and 1464 transitions. [2022-12-13 19:47:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:47:30,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2022-12-13 19:47:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:30,033 INFO L225 Difference]: With dead ends: 1201 [2022-12-13 19:47:30,033 INFO L226 Difference]: Without dead ends: 1201 [2022-12-13 19:47:30,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 19:47:30,034 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 938 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2024 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 19:47:30,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 2024 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:47:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-12-13 19:47:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1199. [2022-12-13 19:47:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 758 states have (on average 1.8944591029023747) internal successors, (1436), 1182 states have internal predecessors, (1436), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:47:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1462 transitions. [2022-12-13 19:47:30,046 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1462 transitions. Word has length 21 [2022-12-13 19:47:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:30,046 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1462 transitions. [2022-12-13 19:47:30,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 19:47:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1462 transitions. [2022-12-13 19:47:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 19:47:30,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:30,046 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] [2022-12-13 19:47:30,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Ended with exit code 0 [2022-12-13 19:47:30,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:30,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-12-13 19:47:30,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:30,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746505958] [2022-12-13 19:47:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:30,251 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 19:47:30,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:30,254 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:30,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:30,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:47:30,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:30,434 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 19:47:30,487 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 19:47:30,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:30,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:30,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746505958] [2022-12-13 19:47:30,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746505958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:30,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:30,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663211194] [2022-12-13 19:47:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:30,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:47:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:47:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:47:30,489 INFO L87 Difference]: Start difference. First operand 1199 states and 1462 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 19:47:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:33,322 INFO L93 Difference]: Finished difference Result 2183 states and 2663 transitions. [2022-12-13 19:47:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:47:33,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2022-12-13 19:47:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:33,327 INFO L225 Difference]: With dead ends: 2183 [2022-12-13 19:47:33,327 INFO L226 Difference]: Without dead ends: 2183 [2022-12-13 19:47:33,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:47:33,328 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2036 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:33,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 2017 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-13 19:47:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2022-12-13 19:47:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1195. [2022-12-13 19:47:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 758 states have (on average 1.883905013192612) internal successors, (1428), 1178 states have internal predecessors, (1428), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:47:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1454 transitions. [2022-12-13 19:47:33,342 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1454 transitions. Word has length 35 [2022-12-13 19:47:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:33,342 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1454 transitions. [2022-12-13 19:47:33,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 19:47:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1454 transitions. [2022-12-13 19:47:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 19:47:33,343 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:33,343 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] [2022-12-13 19:47:33,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Ended with exit code 0 [2022-12-13 19:47:33,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:33,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-12-13 19:47:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:33,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222025943] [2022-12-13 19:47:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:33,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 19:47:33,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:33,546 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:33,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:33,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:47:33,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:33,683 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 19:47:33,817 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 19:47:33,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:33,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:33,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222025943] [2022-12-13 19:47:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222025943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:33,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:33,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713611357] [2022-12-13 19:47:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:33,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:47:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:33,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:47:33,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:47:33,819 INFO L87 Difference]: Start difference. First operand 1195 states and 1454 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 19:47:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:37,462 INFO L93 Difference]: Finished difference Result 1805 states and 2217 transitions. [2022-12-13 19:47:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:47:37,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2022-12-13 19:47:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:37,466 INFO L225 Difference]: With dead ends: 1805 [2022-12-13 19:47:37,466 INFO L226 Difference]: Without dead ends: 1805 [2022-12-13 19:47:37,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:47:37,467 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 1783 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:37,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2579 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-12-13 19:47:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-12-13 19:47:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1191. [2022-12-13 19:47:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 758 states have (on average 1.8733509234828496) internal successors, (1420), 1174 states have internal predecessors, (1420), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:47:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1446 transitions. [2022-12-13 19:47:37,480 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1446 transitions. Word has length 35 [2022-12-13 19:47:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:37,481 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1446 transitions. [2022-12-13 19:47:37,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 19:47:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1446 transitions. [2022-12-13 19:47:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 19:47:37,481 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:37,482 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] [2022-12-13 19:47:37,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Forceful destruction successful, exit code 0 [2022-12-13 19:47:37,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:37,683 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2063932984, now seen corresponding path program 1 times [2022-12-13 19:47:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:37,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487705208] [2022-12-13 19:47:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:37,686 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 19:47:37,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:37,688 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:37,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:37,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 19:47:37,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:37,958 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 19:47:37,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:37,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487705208] [2022-12-13 19:47:37,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487705208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:37,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:37,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845274325] [2022-12-13 19:47:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:37,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:47:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:47:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:47:37,960 INFO L87 Difference]: Start difference. First operand 1191 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:38,006 INFO L93 Difference]: Finished difference Result 1179 states and 1426 transitions. [2022-12-13 19:47:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:47:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-12-13 19:47:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:38,009 INFO L225 Difference]: With dead ends: 1179 [2022-12-13 19:47:38,009 INFO L226 Difference]: Without dead ends: 1179 [2022-12-13 19:47:38,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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 19:47:38,009 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 907 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2002 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 19:47:38,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2002 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:47:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-12-13 19:47:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-12-13 19:47:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 746 states have (on average 1.876675603217158) internal successors, (1400), 1162 states have internal predecessors, (1400), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:47:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1426 transitions. [2022-12-13 19:47:38,018 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1426 transitions. Word has length 54 [2022-12-13 19:47:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:38,018 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1426 transitions. [2022-12-13 19:47:38,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1426 transitions. [2022-12-13 19:47:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 19:47:38,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:38,019 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] [2022-12-13 19:47:38,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:38,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:38,220 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -203146628, now seen corresponding path program 1 times [2022-12-13 19:47:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:38,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780137931] [2022-12-13 19:47:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:38,221 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 19:47:38,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:38,222 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:38,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:38,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:47:38,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:38,524 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 19:47:38,525 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 24 [2022-12-13 19:47:38,562 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 19:47:38,562 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 18 treesize of output 28 [2022-12-13 19:47:38,882 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 19:47:38,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:38,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:38,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780137931] [2022-12-13 19:47:38,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780137931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:38,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003245463] [2022-12-13 19:47:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:38,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:47:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:47:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:47:38,884 INFO L87 Difference]: Start difference. First operand 1179 states and 1426 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:41,937 INFO L93 Difference]: Finished difference Result 2639 states and 3164 transitions. [2022-12-13 19:47:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:47:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-12-13 19:47:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:41,942 INFO L225 Difference]: With dead ends: 2639 [2022-12-13 19:47:41,942 INFO L226 Difference]: Without dead ends: 2639 [2022-12-13 19:47:41,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:47:41,943 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 3028 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3028 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:41,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3028 Valid, 1820 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 19:47:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-12-13 19:47:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 1615. [2022-12-13 19:47:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1167 states have (on average 1.8723221936589547) internal successors, (2185), 1586 states have internal predecessors, (2185), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 19:47:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2235 transitions. [2022-12-13 19:47:41,962 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2235 transitions. Word has length 62 [2022-12-13 19:47:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:41,962 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2235 transitions. [2022-12-13 19:47:41,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2235 transitions. [2022-12-13 19:47:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 19:47:41,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:41,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:42,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:42,164 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash -203146627, now seen corresponding path program 1 times [2022-12-13 19:47:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:42,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544251585] [2022-12-13 19:47:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:42,168 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 19:47:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:42,170 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:42,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:42,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 19:47:42,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:42,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:42,611 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 19:47:42,661 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:47:42,661 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 14 [2022-12-13 19:47:43,034 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 19:47:43,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:43,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:43,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544251585] [2022-12-13 19:47:43,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544251585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:43,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:43,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:47:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828286073] [2022-12-13 19:47:43,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:43,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:47:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:47:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:47:43,036 INFO L87 Difference]: Start difference. First operand 1615 states and 2235 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:46,344 INFO L93 Difference]: Finished difference Result 1621 states and 2242 transitions. [2022-12-13 19:47:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:47:46,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-12-13 19:47:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:46,354 INFO L225 Difference]: With dead ends: 1621 [2022-12-13 19:47:46,354 INFO L226 Difference]: Without dead ends: 1621 [2022-12-13 19:47:46,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:47:46,354 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 111 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:46,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2283 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-13 19:47:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-12-13 19:47:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1620. [2022-12-13 19:47:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1171 states have (on average 1.8693424423569598) internal successors, (2189), 1590 states have internal predecessors, (2189), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-13 19:47:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2241 transitions. [2022-12-13 19:47:46,381 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2241 transitions. Word has length 62 [2022-12-13 19:47:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:46,381 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2241 transitions. [2022-12-13 19:47:46,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2241 transitions. [2022-12-13 19:47:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 19:47:46,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:46,382 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, 1] [2022-12-13 19:47:46,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Ended with exit code 0 [2022-12-13 19:47:46,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:46,583 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 389814229, now seen corresponding path program 1 times [2022-12-13 19:47:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:46,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277586195] [2022-12-13 19:47:46,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:46,587 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 19:47:46,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:46,589 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:46,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:46,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:47:46,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:46,831 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 19:47:46,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:46,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:46,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277586195] [2022-12-13 19:47:46,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277586195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:46,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:46,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:47:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769803729] [2022-12-13 19:47:46,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:46,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:47:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:46,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:47:46,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:47:46,833 INFO L87 Difference]: Start difference. First operand 1620 states and 2241 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:46,921 INFO L93 Difference]: Finished difference Result 1646 states and 2268 transitions. [2022-12-13 19:47:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:47:46,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-12-13 19:47:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:46,926 INFO L225 Difference]: With dead ends: 1646 [2022-12-13 19:47:46,926 INFO L226 Difference]: Without dead ends: 1646 [2022-12-13 19:47:46,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:47:46,927 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 19 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:46,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4855 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:47:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-12-13 19:47:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1644. [2022-12-13 19:47:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1189 states have (on average 1.8603868797308662) internal successors, (2212), 1610 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2022-12-13 19:47:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2268 transitions. [2022-12-13 19:47:46,953 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2268 transitions. Word has length 68 [2022-12-13 19:47:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:46,953 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 2268 transitions. [2022-12-13 19:47:46,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:47:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2268 transitions. [2022-12-13 19:47:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 19:47:46,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:46,954 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, 1] [2022-12-13 19:47:46,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:47,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:47,155 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash 341176989, now seen corresponding path program 1 times [2022-12-13 19:47:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:47,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788050951] [2022-12-13 19:47:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:47,157 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 19:47:47,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:47,159 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:47,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:47,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:47:47,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:47,793 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 19:47:47,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:47,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:47,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788050951] [2022-12-13 19:47:47,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788050951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:47,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:47,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:47:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105983679] [2022-12-13 19:47:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:47,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:47:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:47,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:47:47,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:47:47,794 INFO L87 Difference]: Start difference. First operand 1644 states and 2268 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 19:47:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:47,930 INFO L93 Difference]: Finished difference Result 1656 states and 2282 transitions. [2022-12-13 19:47:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:47:47,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2022-12-13 19:47:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:47,934 INFO L225 Difference]: With dead ends: 1656 [2022-12-13 19:47:47,934 INFO L226 Difference]: Without dead ends: 1656 [2022-12-13 19:47:47,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:47:47,934 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 20 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:47,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3777 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:47:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-12-13 19:47:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1647. [2022-12-13 19:47:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1191 states have (on average 1.858942065491184) internal successors, (2214), 1612 states have internal predecessors, (2214), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-12-13 19:47:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2271 transitions. [2022-12-13 19:47:47,951 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2271 transitions. Word has length 68 [2022-12-13 19:47:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:47,951 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2271 transitions. [2022-12-13 19:47:47,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 19:47:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2271 transitions. [2022-12-13 19:47:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 19:47:47,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:47,951 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, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:47,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Forceful destruction successful, exit code 0 [2022-12-13 19:47:48,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:48,153 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -233122725, now seen corresponding path program 1 times [2022-12-13 19:47:48,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:48,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511856694] [2022-12-13 19:47:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:48,156 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 19:47:48,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:48,158 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:48,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:48,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:47:48,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:48,503 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 19:47:48,603 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2022-12-13 19:47:48,618 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 19:47:48,618 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 19:47:48,629 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 19:47:48,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:48,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511856694] [2022-12-13 19:47:48,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511856694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:48,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:48,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:47:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526706886] [2022-12-13 19:47:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:48,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:47:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:47:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-12-13 19:47:48,631 INFO L87 Difference]: Start difference. First operand 1647 states and 2271 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 19:47:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:52,161 INFO L93 Difference]: Finished difference Result 2769 states and 3749 transitions. [2022-12-13 19:47:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:47:52,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2022-12-13 19:47:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:52,170 INFO L225 Difference]: With dead ends: 2769 [2022-12-13 19:47:52,170 INFO L226 Difference]: Without dead ends: 2769 [2022-12-13 19:47:52,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-12-13 19:47:52,171 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1428 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1894 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:52,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2219 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2121 Invalid, 0 Unknown, 1894 Unchecked, 3.5s Time] [2022-12-13 19:47:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2022-12-13 19:47:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1646. [2022-12-13 19:47:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1191 states have (on average 1.8572628043660788) internal successors, (2212), 1611 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-12-13 19:47:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2269 transitions. [2022-12-13 19:47:52,190 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2269 transitions. Word has length 73 [2022-12-13 19:47:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:52,190 INFO L495 AbstractCegarLoop]: Abstraction has 1646 states and 2269 transitions. [2022-12-13 19:47:52,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 19:47:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2269 transitions. [2022-12-13 19:47:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 19:47:52,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:52,191 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, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:52,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Ended with exit code 0 [2022-12-13 19:47:52,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:52,393 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash -233122724, now seen corresponding path program 1 times [2022-12-13 19:47:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:52,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096544530] [2022-12-13 19:47:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:52,396 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 19:47:52,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:52,400 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:52,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:52,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 19:47:52,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:52,765 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 19:47:52,769 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 19:47:53,092 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_1107 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |alt_malloc_#res.base| v_ArrVal_1107))) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2022-12-13 19:47:53,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:47:53,106 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 19:47:53,111 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:47:53,112 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 19:47:53,123 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 19:47:53,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:53,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:53,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096544530] [2022-12-13 19:47:53,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096544530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:53,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:53,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:47:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227632946] [2022-12-13 19:47:53,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:53,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:47:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:47:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-12-13 19:47:53,125 INFO L87 Difference]: Start difference. First operand 1646 states and 2269 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 19:47:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:58,510 INFO L93 Difference]: Finished difference Result 2840 states and 3874 transitions. [2022-12-13 19:47:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:47:58,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2022-12-13 19:47:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:47:58,514 INFO L225 Difference]: With dead ends: 2840 [2022-12-13 19:47:58,514 INFO L226 Difference]: Without dead ends: 2840 [2022-12-13 19:47:58,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-12-13 19:47:58,514 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 2151 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 5020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1900 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:47:58,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 2397 Invalid, 5020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3092 Invalid, 0 Unknown, 1900 Unchecked, 5.3s Time] [2022-12-13 19:47:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-12-13 19:47:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1642. [2022-12-13 19:47:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1195 states have (on average 1.8410041841004183) internal successors, (2200), 1607 states have internal predecessors, (2200), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-12-13 19:47:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2257 transitions. [2022-12-13 19:47:58,540 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2257 transitions. Word has length 73 [2022-12-13 19:47:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:47:58,541 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 2257 transitions. [2022-12-13 19:47:58,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 19:47:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2257 transitions. [2022-12-13 19:47:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 19:47:58,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:47:58,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:47:58,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:58,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:58,743 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:47:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash -159183299, now seen corresponding path program 1 times [2022-12-13 19:47:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:47:58,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203622476] [2022-12-13 19:47:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:58,744 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 19:47:58,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:47:58,745 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:58,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:47:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:59,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 19:47:59,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:47:59,059 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 19:47:59,074 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 19:47:59,098 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 19:47:59,127 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 19:47:59,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:47:59,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:47:59,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203622476] [2022-12-13 19:47:59,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203622476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:59,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:59,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:47:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160360028] [2022-12-13 19:47:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:59,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 19:47:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:47:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 19:47:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:47:59,131 INFO L87 Difference]: Start difference. First operand 1642 states and 2257 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:48:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:48:02,678 INFO L93 Difference]: Finished difference Result 1657 states and 2273 transitions. [2022-12-13 19:48:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:48:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2022-12-13 19:48:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:48:02,681 INFO L225 Difference]: With dead ends: 1657 [2022-12-13 19:48:02,681 INFO L226 Difference]: Without dead ends: 1657 [2022-12-13 19:48:02,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:48:02,682 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 23 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4068 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:48:02,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4068 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 19:48:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-12-13 19:48:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1656. [2022-12-13 19:48:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.835956917978459) internal successors, (2216), 1619 states have internal predecessors, (2216), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-12-13 19:48:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2273 transitions. [2022-12-13 19:48:02,701 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2273 transitions. Word has length 80 [2022-12-13 19:48:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:48:02,701 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2273 transitions. [2022-12-13 19:48:02,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:48:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2273 transitions. [2022-12-13 19:48:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 19:48:02,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:48:02,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:48:02,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:02,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:02,903 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:48:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash -639714905, now seen corresponding path program 1 times [2022-12-13 19:48:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:48:02,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299440836] [2022-12-13 19:48:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:48:02,904 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 19:48:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:48:02,905 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:02,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Waiting until timeout for monitored process [2022-12-13 19:48:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:48:03,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 19:48:03,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:03,155 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 19:48:03,181 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 19:48:03,187 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 19:48:03,232 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 19:48:03,236 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 19:48:03,309 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 19:48:03,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:48:03,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:48:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299440836] [2022-12-13 19:48:03,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299440836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:48:03,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:48:03,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 19:48:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506996312] [2022-12-13 19:48:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:48:03,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 19:48:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:48:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 19:48:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 19:48:03,311 INFO L87 Difference]: Start difference. First operand 1656 states and 2273 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:48:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:48:08,076 INFO L93 Difference]: Finished difference Result 1656 states and 2271 transitions. [2022-12-13 19:48:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:48:08,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2022-12-13 19:48:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:48:08,078 INFO L225 Difference]: With dead ends: 1656 [2022-12-13 19:48:08,078 INFO L226 Difference]: Without dead ends: 1656 [2022-12-13 19:48:08,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 19:48:08,079 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 19 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:48:08,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4864 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-13 19:48:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-12-13 19:48:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2022-12-13 19:48:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.8342999171499585) internal successors, (2214), 1619 states have internal predecessors, (2214), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-12-13 19:48:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2271 transitions. [2022-12-13 19:48:08,091 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2271 transitions. Word has length 81 [2022-12-13 19:48:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:48:08,091 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2271 transitions. [2022-12-13 19:48:08,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:48:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2271 transitions. [2022-12-13 19:48:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 19:48:08,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:48:08,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:48:08,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Forceful destruction successful, exit code 0 [2022-12-13 19:48:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:08,292 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:48:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1094788593, now seen corresponding path program 1 times [2022-12-13 19:48:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:48:08,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549283712] [2022-12-13 19:48:08,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:48:08,293 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 19:48:08,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:48:08,294 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:08,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:48:08,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:48:08,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:08,562 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 19:48:08,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:48:08,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:48:08,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549283712] [2022-12-13 19:48:08,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549283712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:48:08,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:48:08,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:48:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800495511] [2022-12-13 19:48:08,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:48:08,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:48:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:48:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:48:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:48:08,564 INFO L87 Difference]: Start difference. First operand 1656 states and 2271 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:48:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:48:08,621 INFO L93 Difference]: Finished difference Result 1672 states and 2289 transitions. [2022-12-13 19:48:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:48:08,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2022-12-13 19:48:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:48:08,623 INFO L225 Difference]: With dead ends: 1672 [2022-12-13 19:48:08,623 INFO L226 Difference]: Without dead ends: 1666 [2022-12-13 19:48:08,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:48:08,624 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 13 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:48:08,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2878 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:48:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-12-13 19:48:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-12-13 19:48:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1215 states have (on average 1.8304526748971193) internal successors, (2224), 1629 states have internal predecessors, (2224), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:48:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2283 transitions. [2022-12-13 19:48:08,637 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2283 transitions. Word has length 88 [2022-12-13 19:48:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:48:08,637 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 2283 transitions. [2022-12-13 19:48:08,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:48:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2283 transitions. [2022-12-13 19:48:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 19:48:08,638 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:48:08,638 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, 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 19:48:08,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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)] Ended with exit code 0 [2022-12-13 19:48:08,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:08,839 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:48:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:08,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1402763991, now seen corresponding path program 1 times [2022-12-13 19:48:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:48:08,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571976312] [2022-12-13 19:48:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:48:08,841 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 19:48:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:48:08,843 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:08,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (23)] Waiting until timeout for monitored process [2022-12-13 19:48:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:48:09,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:48:09,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:09,178 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 19:48:09,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:48:09,289 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 19:48:09,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:48:09,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571976312] [2022-12-13 19:48:09,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571976312] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:48:09,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:48:09,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-12-13 19:48:09,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056627548] [2022-12-13 19:48:09,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:48:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 19:48:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:48:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 19:48:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:48:09,291 INFO L87 Difference]: Start difference. First operand 1666 states and 2283 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:48:09,472 INFO L93 Difference]: Finished difference Result 1692 states and 2313 transitions. [2022-12-13 19:48:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 19:48:09,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2022-12-13 19:48:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:48:09,475 INFO L225 Difference]: With dead ends: 1692 [2022-12-13 19:48:09,475 INFO L226 Difference]: Without dead ends: 1680 [2022-12-13 19:48:09,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-13 19:48:09,475 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 37 mSDsluCounter, 3839 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:48:09,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4804 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:48:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-12-13 19:48:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1674. [2022-12-13 19:48:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1223 states have (on average 1.8266557645134913) internal successors, (2234), 1637 states have internal predecessors, (2234), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:48:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2293 transitions. [2022-12-13 19:48:09,492 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2293 transitions. Word has length 89 [2022-12-13 19:48:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:48:09,493 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2293 transitions. [2022-12-13 19:48:09,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2293 transitions. [2022-12-13 19:48:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 19:48:09,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:48:09,493 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, 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 19:48:09,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (23)] Ended with exit code 0 [2022-12-13 19:48:09,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:09,694 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:48:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:09,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1478348943, now seen corresponding path program 2 times [2022-12-13 19:48:09,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:48:09,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138466257] [2022-12-13 19:48:09,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:48:09,695 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 19:48:09,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:48:09,696 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:09,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (24)] Waiting until timeout for monitored process [2022-12-13 19:48:10,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:48:10,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:48:10,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 19:48:10,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:10,318 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 19:48:10,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:48:10,658 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 19:48:10,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:48:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138466257] [2022-12-13 19:48:10,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138466257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:48:10,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:48:10,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-12-13 19:48:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265913230] [2022-12-13 19:48:10,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:48:10,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 19:48:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:48:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 19:48:10,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-12-13 19:48:10,660 INFO L87 Difference]: Start difference. First operand 1674 states and 2293 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:48:11,556 INFO L93 Difference]: Finished difference Result 1728 states and 2361 transitions. [2022-12-13 19:48:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 19:48:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 92 [2022-12-13 19:48:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:48:11,560 INFO L225 Difference]: With dead ends: 1728 [2022-12-13 19:48:11,560 INFO L226 Difference]: Without dead ends: 1716 [2022-12-13 19:48:11,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2022-12-13 19:48:11,561 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 52 mSDsluCounter, 8660 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 9631 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:48:11,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 9631 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 19:48:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-12-13 19:48:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1692. [2022-12-13 19:48:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1241 states have (on average 1.8195004029008863) internal successors, (2258), 1655 states have internal predecessors, (2258), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:48:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2317 transitions. [2022-12-13 19:48:11,585 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2317 transitions. Word has length 92 [2022-12-13 19:48:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:48:11,585 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 2317 transitions. [2022-12-13 19:48:11,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2317 transitions. [2022-12-13 19:48:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 19:48:11,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:48:11,586 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, 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 19:48:11,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (24)] Ended with exit code 0 [2022-12-13 19:48:11,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:11,787 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:48:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2075896399, now seen corresponding path program 3 times [2022-12-13 19:48:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:48:11,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256176267] [2022-12-13 19:48:11,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:48:11,788 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 19:48:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:48:11,789 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:11,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (25)] Waiting until timeout for monitored process [2022-12-13 19:48:12,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 19:48:12,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:48:12,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 19:48:12,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:12,915 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 19:48:12,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:48:13,880 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 19:48:13,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:48:13,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256176267] [2022-12-13 19:48:13,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256176267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:48:13,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:48:13,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-12-13 19:48:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054884654] [2022-12-13 19:48:13,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:48:13,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 19:48:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:48:13,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 19:48:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2022-12-13 19:48:13,883 INFO L87 Difference]: Start difference. First operand 1692 states and 2317 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:48:17,639 INFO L93 Difference]: Finished difference Result 1800 states and 2465 transitions. [2022-12-13 19:48:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 19:48:17,639 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2022-12-13 19:48:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:48:17,641 INFO L225 Difference]: With dead ends: 1800 [2022-12-13 19:48:17,642 INFO L226 Difference]: Without dead ends: 1782 [2022-12-13 19:48:17,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=924, Invalid=1832, Unknown=0, NotChecked=0, Total=2756 [2022-12-13 19:48:17,642 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 148 mSDsluCounter, 13639 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 14622 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:48:17,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 14622 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 19:48:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-12-13 19:48:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1728. [2022-12-13 19:48:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1277 states have (on average 1.8042286609240408) internal successors, (2304), 1691 states have internal predecessors, (2304), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:48:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2363 transitions. [2022-12-13 19:48:17,661 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2363 transitions. Word has length 98 [2022-12-13 19:48:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:48:17,661 INFO L495 AbstractCegarLoop]: Abstraction has 1728 states and 2363 transitions. [2022-12-13 19:48:17,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2363 transitions. [2022-12-13 19:48:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 19:48:17,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:48:17,662 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, 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 19:48:17,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (25)] Forceful destruction successful, exit code 0 [2022-12-13 19:48:17,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:17,863 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:48:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash -493120975, now seen corresponding path program 4 times [2022-12-13 19:48:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:48:17,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621015108] [2022-12-13 19:48:17,864 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:48:17,864 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 19:48:17,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:48:17,865 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:17,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (26)] Waiting until timeout for monitored process [2022-12-13 19:48:18,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:48:18,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:48:18,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 19:48:18,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:18,807 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 19:48:18,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:48:20,877 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 19:48:20,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:48:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621015108] [2022-12-13 19:48:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621015108] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:48:20,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:48:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2022-12-13 19:48:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616073872] [2022-12-13 19:48:20,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:48:20,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 19:48:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:48:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 19:48:20,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-12-13 19:48:20,879 INFO L87 Difference]: Start difference. First operand 1728 states and 2363 transitions. Second operand has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:48:31,655 INFO L93 Difference]: Finished difference Result 1934 states and 2633 transitions. [2022-12-13 19:48:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-12-13 19:48:31,656 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 110 [2022-12-13 19:48:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:48:31,658 INFO L225 Difference]: With dead ends: 1934 [2022-12-13 19:48:31,659 INFO L226 Difference]: Without dead ends: 1922 [2022-12-13 19:48:31,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=4121, Invalid=9921, Unknown=0, NotChecked=0, Total=14042 [2022-12-13 19:48:31,661 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 178 mSDsluCounter, 26849 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 27854 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:48:31,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 27854 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 19:48:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2022-12-13 19:48:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1796. [2022-12-13 19:48:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1345 states have (on average 1.7814126394052046) internal successors, (2396), 1759 states have internal predecessors, (2396), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:48:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2455 transitions. [2022-12-13 19:48:31,680 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2455 transitions. Word has length 110 [2022-12-13 19:48:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:48:31,681 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 2455 transitions. [2022-12-13 19:48:31,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:48:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2455 transitions. [2022-12-13 19:48:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 19:48:31,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:48:31,682 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, 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 19:48:31,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (26)] Ended with exit code 0 [2022-12-13 19:48:31,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:31,882 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:48:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:48:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 495144561, now seen corresponding path program 5 times [2022-12-13 19:48:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:48:31,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119987926] [2022-12-13 19:48:31,884 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:48:31,884 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 19:48:31,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:48:31,885 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:48:31,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (27)] Waiting until timeout for monitored process [2022-12-13 19:48:33,377 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 19:48:33,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:48:33,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 19:48:33,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:48:33,427 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 19:48:33,553 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:48:33,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:48:33,578 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 19:48:33,691 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 24 treesize of output 12 [2022-12-13 19:48:35,707 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:48:35,708 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 36 treesize of output 37 [2022-12-13 19:48:35,749 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 33 treesize of output 15 [2022-12-13 19:48:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:48:35,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:48:38,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:48:38,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119987926] [2022-12-13 19:48:38,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119987926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:48:38,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [931594874] [2022-12-13 19:48:38,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:48:38,154 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:48:38,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:48:38,155 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:48:38,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-12-13 19:49:47,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 19:49:47,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:49:47,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 19:49:47,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:49:47,865 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 19:49:47,992 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:49:47,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:49:48,002 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 19:49:48,058 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 24 treesize of output 12 [2022-12-13 19:49:50,025 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:49:50,026 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 36 treesize of output 37 [2022-12-13 19:49:50,074 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 33 treesize of output 15 [2022-12-13 19:49:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:49:50,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:49:50,347 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3142) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-12-13 19:49:50,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [931594874] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:49:50,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:49:50,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-12-13 19:49:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825504187] [2022-12-13 19:49:50,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:49:50,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:49:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:49:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:49:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=217, Unknown=16, NotChecked=30, Total=306 [2022-12-13 19:49:50,351 INFO L87 Difference]: Start difference. First operand 1796 states and 2455 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:50:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:50:01,883 INFO L93 Difference]: Finished difference Result 2266 states and 3051 transitions. [2022-12-13 19:50:01,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 19:50:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 132 [2022-12-13 19:50:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:50:01,887 INFO L225 Difference]: With dead ends: 2266 [2022-12-13 19:50:01,887 INFO L226 Difference]: Without dead ends: 2266 [2022-12-13 19:50:01,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 166 SyntacticMatches, 89 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=113, Invalid=566, Unknown=27, NotChecked=50, Total=756 [2022-12-13 19:50:01,888 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 1669 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 4596 mSolverCounterSat, 33 mSolverCounterUnsat, 842 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 5471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4596 IncrementalHoareTripleChecker+Invalid, 842 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:50:01,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 4283 Invalid, 5471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4596 Invalid, 842 Unknown, 0 Unchecked, 11.1s Time] [2022-12-13 19:50:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-12-13 19:50:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1793. [2022-12-13 19:50:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1345 states have (on average 1.7769516728624535) internal successors, (2390), 1756 states have internal predecessors, (2390), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:50:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2449 transitions. [2022-12-13 19:50:01,909 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2449 transitions. Word has length 132 [2022-12-13 19:50:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:50:01,909 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2449 transitions. [2022-12-13 19:50:01,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:50:01,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2449 transitions. [2022-12-13 19:50:01,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 19:50:01,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:50:01,911 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, 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 19:50:01,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-12-13 19:50:02,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (27)] Forceful destruction successful, exit code 0 [2022-12-13 19:50:02,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:50:02,312 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:50:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash 495144562, now seen corresponding path program 1 times [2022-12-13 19:50:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:50:02,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703614417] [2022-12-13 19:50:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:02,314 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 19:50:02,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:50:02,315 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:50:02,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (29)] Waiting until timeout for monitored process [2022-12-13 19:50:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:03,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-13 19:50:03,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:50:03,066 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 19:50:03,304 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 19:50:03,341 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:50:03,341 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 19:50:03,366 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 19:50:03,374 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 19:50:03,464 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 19:50:03,467 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 19:50:05,273 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:50:05,273 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 19:50:05,278 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 19:50:05,329 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 19:50:05,334 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 19:50:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:50:05,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:50:06,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 19:50:06,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:50:06,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703614417] [2022-12-13 19:50:06,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703614417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:50:06,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1412661036] [2022-12-13 19:50:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:06,150 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:50:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:50:06,150 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:50:06,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-12-13 19:51:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:51:59,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 118 conjunts are in the unsatisfiable core [2022-12-13 19:51:59,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:51:59,587 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 19:51:59,731 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 19:51:59,747 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:51:59,747 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 19:51:59,789 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 19:51:59,794 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 19:51:59,944 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 19:51:59,947 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 19:52:01,717 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4191))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-12-13 19:52:01,751 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:52:01,751 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 19:52:01,757 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 19:52:01,831 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 19:52:01,835 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 19:52:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 19:52:01,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:52:02,510 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |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~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |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 19:52:02,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1412661036] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:52:02,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:52:02,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2022-12-13 19:52:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008866037] [2022-12-13 19:52:02,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:52:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 19:52:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:52:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 19:52:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=391, Unknown=20, NotChecked=126, Total=600 [2022-12-13 19:52:02,517 INFO L87 Difference]: Start difference. First operand 1793 states and 2449 transitions. Second operand has 21 states, 18 states have (on average 8.38888888888889) internal successors, (151), 17 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:52:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:52:21,879 INFO L93 Difference]: Finished difference Result 2912 states and 3923 transitions. [2022-12-13 19:52:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 19:52:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.38888888888889) internal successors, (151), 17 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 132 [2022-12-13 19:52:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:52:21,882 INFO L225 Difference]: With dead ends: 2912 [2022-12-13 19:52:21,882 INFO L226 Difference]: Without dead ends: 2912 [2022-12-13 19:52:21,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 160 SyntacticMatches, 89 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=127, Invalid=786, Unknown=29, NotChecked=180, Total=1122 [2022-12-13 19:52:21,883 INFO L413 NwaCegarLoop]: 790 mSDtfsCounter, 1995 mSDsluCounter, 6205 mSDsCounter, 0 mSdLazyCounter, 11246 mSolverCounterSat, 29 mSolverCounterUnsat, 666 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 6995 SdHoareTripleChecker+Invalid, 13423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11246 IncrementalHoareTripleChecker+Invalid, 666 IncrementalHoareTripleChecker+Unknown, 1482 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-12-13 19:52:21,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2000 Valid, 6995 Invalid, 13423 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 11246 Invalid, 666 Unknown, 1482 Unchecked, 18.8s Time] [2022-12-13 19:52:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2022-12-13 19:52:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1792. [2022-12-13 19:52:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1345 states have (on average 1.7754646840148698) internal successors, (2388), 1755 states have internal predecessors, (2388), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:52:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2447 transitions. [2022-12-13 19:52:21,898 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2447 transitions. Word has length 132 [2022-12-13 19:52:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:52:21,898 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 2447 transitions. [2022-12-13 19:52:21,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.38888888888889) internal successors, (151), 17 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:52:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2447 transitions. [2022-12-13 19:52:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 19:52:21,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:52:21,899 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, 1, 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 19:52:21,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (29)] Ended with exit code 0 [2022-12-13 19:52:22,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-12-13 19:52:22,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:52:22,300 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:52:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:52:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250012, now seen corresponding path program 1 times [2022-12-13 19:52:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:52:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214715115] [2022-12-13 19:52:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:52:22,303 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 19:52:22,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:52:22,304 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:52:22,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (31)] Waiting until timeout for monitored process [2022-12-13 19:52:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:52:23,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 19:52:23,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:52:23,374 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 19:52:23,489 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:52:23,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:52:23,510 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 19:52:23,602 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 24 treesize of output 12 [2022-12-13 19:52:25,493 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_47) (_ bv1 1))) (not (= v_arrayElimCell_47 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) (_ bv1 1))))) (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4723)))) is different from true [2022-12-13 19:52:25,548 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:52:25,548 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 36 treesize of output 37 [2022-12-13 19:52:25,659 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:52:25,659 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 36 treesize of output 37 [2022-12-13 19:52:25,678 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 33 treesize of output 15 [2022-12-13 19:52:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 19:52:25,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:52:27,841 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 19:52:28,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4770))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4724)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 19:52:28,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:52:28,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214715115] [2022-12-13 19:52:28,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214715115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:52:28,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [481893312] [2022-12-13 19:52:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:52:28,082 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:52:28,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:52:28,083 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:52:28,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-13 19:52:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:52:32,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 19:52:32,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:52:32,392 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 19:52:32,531 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:52:32,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:52:32,547 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 19:52:32,600 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 24 treesize of output 12 [2022-12-13 19:52:34,566 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:52:34,566 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 36 treesize of output 37 [2022-12-13 19:52:34,640 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:52:34,640 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 36 treesize of output 37 [2022-12-13 19:52:34,660 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 33 treesize of output 15 [2022-12-13 19:52:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:52:34,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:52:34,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5210) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 19:52:34,697 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:52:34,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5256))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5210)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:52:34,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [481893312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:52:34,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:52:34,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2022-12-13 19:52:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577667698] [2022-12-13 19:52:34,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:52:34,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 19:52:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:52:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 19:52:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=249, Unknown=23, NotChecked=222, Total=552 [2022-12-13 19:52:34,955 INFO L87 Difference]: Start difference. First operand 1792 states and 2447 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:52:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:52:48,926 INFO L93 Difference]: Finished difference Result 2264 states and 3047 transitions. [2022-12-13 19:52:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 19:52:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 135 [2022-12-13 19:52:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:52:48,929 INFO L225 Difference]: With dead ends: 2264 [2022-12-13 19:52:48,929 INFO L226 Difference]: Without dead ends: 2264 [2022-12-13 19:52:48,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 173 SyntacticMatches, 89 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=137, Invalid=664, Unknown=35, NotChecked=354, Total=1190 [2022-12-13 19:52:48,930 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 1662 mSDsluCounter, 4601 mSDsCounter, 0 mSdLazyCounter, 5408 mSolverCounterSat, 32 mSolverCounterUnsat, 838 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 5101 SdHoareTripleChecker+Invalid, 7255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5408 IncrementalHoareTripleChecker+Invalid, 838 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:52:48,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 5101 Invalid, 7255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 5408 Invalid, 838 Unknown, 977 Unchecked, 13.4s Time] [2022-12-13 19:52:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-12-13 19:52:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1791. [2022-12-13 19:52:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1345 states have (on average 1.7739776951672863) internal successors, (2386), 1754 states have internal predecessors, (2386), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:52:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2445 transitions. [2022-12-13 19:52:48,946 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2445 transitions. Word has length 135 [2022-12-13 19:52:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:52:48,946 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 2445 transitions. [2022-12-13 19:52:48,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:52:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2445 transitions. [2022-12-13 19:52:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 19:52:48,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:52:48,947 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, 1, 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 19:52:48,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-12-13 19:52:49,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (31)] Ended with exit code 0 [2022-12-13 19:52:49,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:52:49,349 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:52:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:52:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250013, now seen corresponding path program 1 times [2022-12-13 19:52:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:52:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639249320] [2022-12-13 19:52:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:52:49,352 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 19:52:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:52:49,353 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:52:49,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (33)] Waiting until timeout for monitored process [2022-12-13 19:52:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:52:50,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2022-12-13 19:52:50,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:52:50,233 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 19:52:50,497 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 19:52:50,536 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:50,537 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 19:52:50,579 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 19:52:50,590 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 19:52:50,713 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 19:52:50,717 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 19:52:52,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5740))) (exists ((v_arrayElimCell_59 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_59) (_ bv44 32))) (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5741) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 19:52:52,743 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:52:52,743 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 19:52:52,747 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 19:52:52,864 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:52:52,864 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 19:52:52,872 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 19:52:52,890 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 19:52:52,896 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 19:52:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 19:52:52,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:52:53,136 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 19:52:53,172 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-13 19:52:53,925 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-13 19:52:53,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:52:53,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639249320] [2022-12-13 19:52:53,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639249320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:52:53,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1124235140] [2022-12-13 19:52:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:52:53,933 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:52:53,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:52:53,934 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:52:53,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-12-13 19:52:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:52:57,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-13 19:52:57,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:52:57,805 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 19:52:57,810 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 19:52:58,427 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:52:58,427 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 19:52:58,433 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 19:52:58,513 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 19:52:58,524 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 19:52:58,632 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 19:52:58,713 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 7 treesize of output 3 [2022-12-13 19:53:02,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:02,312 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 16 treesize of output 18 [2022-12-13 19:53:02,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:02,539 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-12-13 19:53:02,554 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-13 19:53:02,554 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 60 treesize of output 44 [2022-12-13 19:53:02,686 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 17 treesize of output 9 [2022-12-13 19:53:02,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 15 treesize of output 7 [2022-12-13 19:53:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:53:02,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:53:03,261 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 231 treesize of output 159 [2022-12-13 19:53:06,325 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6327 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_77 (_ BitVec 32))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6327))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_6278 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_77 (store (select .cse1 v_arrayElimCell_77) (bvadd (_ bv16 32) .cse2) v_ArrVal_6278)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_77))))))) (forall ((v_ArrVal_6327 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_77 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6327))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (select |c_#length| v_arrayElimCell_77))) (or (forall ((v_prenex_6 (_ BitVec 32))) (let ((.cse4 (bvadd (_ bv8 32) (select (select (store .cse6 v_arrayElimCell_77 (store (select .cse6 v_arrayElimCell_77) (bvadd (_ bv16 32) .cse7) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (or (forall ((v_ArrVal_6279 (_ BitVec 32))) (bvule .cse4 (select |c_#length| v_ArrVal_6279))) (bvule .cse4 .cse5)))) (not (bvule (bvadd .cse7 (_ bv20 32)) .cse5)))))))) is different from false [2022-12-13 19:53:06,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1124235140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:06,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:53:06,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2022-12-13 19:53:06,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431610193] [2022-12-13 19:53:06,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:53:06,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 19:53:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:53:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 19:53:06,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1077, Unknown=19, NotChecked=350, Total=1560 [2022-12-13 19:53:06,343 INFO L87 Difference]: Start difference. First operand 1791 states and 2445 transitions. Second operand has 32 states, 29 states have (on average 5.827586206896552) internal successors, (169), 26 states have internal predecessors, (169), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 19:53:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:53:36,080 INFO L93 Difference]: Finished difference Result 2444 states and 3327 transitions. [2022-12-13 19:53:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 19:53:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.827586206896552) internal successors, (169), 26 states have internal predecessors, (169), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 135 [2022-12-13 19:53:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:53:36,083 INFO L225 Difference]: With dead ends: 2444 [2022-12-13 19:53:36,083 INFO L226 Difference]: Without dead ends: 2444 [2022-12-13 19:53:36,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 160 SyntacticMatches, 86 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=206, Invalid=1677, Unknown=29, NotChecked=440, Total=2352 [2022-12-13 19:53:36,084 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 1839 mSDsluCounter, 10215 mSDsCounter, 0 mSdLazyCounter, 14383 mSolverCounterSat, 42 mSolverCounterUnsat, 391 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 11242 SdHoareTripleChecker+Invalid, 16292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 14383 IncrementalHoareTripleChecker+Invalid, 391 IncrementalHoareTripleChecker+Unknown, 1476 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:53:36,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 11242 Invalid, 16292 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 14383 Invalid, 391 Unknown, 1476 Unchecked, 28.6s Time] [2022-12-13 19:53:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2022-12-13 19:53:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 1790. [2022-12-13 19:53:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1345 states have (on average 1.7724907063197026) internal successors, (2384), 1753 states have internal predecessors, (2384), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:53:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2443 transitions. [2022-12-13 19:53:36,103 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2443 transitions. Word has length 135 [2022-12-13 19:53:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:53:36,104 INFO L495 AbstractCegarLoop]: Abstraction has 1790 states and 2443 transitions. [2022-12-13 19:53:36,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.827586206896552) internal successors, (169), 26 states have internal predecessors, (169), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 19:53:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2443 transitions. [2022-12-13 19:53:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 19:53:36,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:53:36,104 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, 1, 1, 1, 1, 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 19:53:36,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (33)] Ended with exit code 0 [2022-12-13 19:53:36,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2022-12-13 19:53:36,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:53:36,506 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:53:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:53:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199032, now seen corresponding path program 1 times [2022-12-13 19:53:36,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:53:36,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385506871] [2022-12-13 19:53:36,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:53:36,508 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 19:53:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:53:36,509 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:53:36,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (35)] Waiting until timeout for monitored process [2022-12-13 19:53:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:37,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 19:53:37,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:53:37,452 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 19:53:37,620 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:53:37,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:53:37,653 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 19:53:37,769 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 24 treesize of output 12 [2022-12-13 19:53:39,730 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20|)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20|) (_ bv1 1))))) (exists ((v_ArrVal_6781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6781)))) is different from true [2022-12-13 19:53:39,783 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:53:39,783 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 36 treesize of output 37 [2022-12-13 19:53:39,884 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:53:39,884 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 36 treesize of output 37 [2022-12-13 19:53:39,968 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:53:39,968 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 36 treesize of output 37 [2022-12-13 19:53:39,987 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 33 treesize of output 15 [2022-12-13 19:53:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 19:53:40,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:53:40,114 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_6783) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 19:53:40,125 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:53:40,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6782))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6783)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:53:40,154 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6782))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6783)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 19:53:40,425 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6829))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6782)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6783)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 19:53:40,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:53:40,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385506871] [2022-12-13 19:53:40,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385506871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [266191139] [2022-12-13 19:53:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:53:40,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:53:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:53:40,430 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:53:40,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-12-13 19:53:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:45,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 19:53:45,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:53:45,324 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 19:53:45,451 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:53:45,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:53:45,464 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 19:53:45,521 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 24 treesize of output 12 [2022-12-13 19:53:47,541 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:53:47,541 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 36 treesize of output 37 [2022-12-13 19:53:47,608 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:53:47,609 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 36 treesize of output 37 [2022-12-13 19:53:47,645 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:53:47,646 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 36 treesize of output 37 [2022-12-13 19:53:47,661 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 33 treesize of output 15 [2022-12-13 19:53:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:53:47,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:53:47,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7285) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-12-13 19:53:47,696 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-12-13 19:53:47,713 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7284))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:53:47,729 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7284))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:53:48,019 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7331))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7284)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:53:48,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [266191139] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:48,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:53:48,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2022-12-13 19:53:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981010474] [2022-12-13 19:53:48,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:53:48,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 19:53:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:53:48,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 19:53:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=254, Unknown=26, NotChecked=462, Total=812 [2022-12-13 19:53:48,024 INFO L87 Difference]: Start difference. First operand 1790 states and 2443 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:54:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:02,646 INFO L93 Difference]: Finished difference Result 2262 states and 3043 transitions. [2022-12-13 19:54:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 19:54:02,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 138 [2022-12-13 19:54:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:54:02,648 INFO L225 Difference]: With dead ends: 2262 [2022-12-13 19:54:02,648 INFO L226 Difference]: Without dead ends: 2262 [2022-12-13 19:54:02,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 180 SyntacticMatches, 89 SemanticMatches, 39 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=157, Invalid=718, Unknown=39, NotChecked=726, Total=1640 [2022-12-13 19:54:02,649 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 1655 mSDsluCounter, 4925 mSDsCounter, 0 mSdLazyCounter, 5606 mSolverCounterSat, 32 mSolverCounterUnsat, 973 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 5424 SdHoareTripleChecker+Invalid, 8004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5606 IncrementalHoareTripleChecker+Invalid, 973 IncrementalHoareTripleChecker+Unknown, 1393 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:54:02,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 5424 Invalid, 8004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 5606 Invalid, 973 Unknown, 1393 Unchecked, 14.0s Time] [2022-12-13 19:54:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2022-12-13 19:54:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1789. [2022-12-13 19:54:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1345 states have (on average 1.771003717472119) internal successors, (2382), 1752 states have internal predecessors, (2382), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:54:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2441 transitions. [2022-12-13 19:54:02,663 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2441 transitions. Word has length 138 [2022-12-13 19:54:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:54:02,663 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2441 transitions. [2022-12-13 19:54:02,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:54:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2441 transitions. [2022-12-13 19:54:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 19:54:02,664 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:54:02,664 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, 1, 1, 1, 1, 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 19:54:02,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-12-13 19:54:02,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (35)] Ended with exit code 0 [2022-12-13 19:54:03,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:54:03,065 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:54:03,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199033, now seen corresponding path program 1 times [2022-12-13 19:54:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:54:03,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987238529] [2022-12-13 19:54:03,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:03,066 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 19:54:03,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:54:03,067 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:54:03,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (37)] Waiting until timeout for monitored process [2022-12-13 19:54:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:04,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 126 conjunts are in the unsatisfiable core [2022-12-13 19:54:04,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:54:04,043 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 19:54:04,302 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 19:54:04,334 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:54:04,335 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 19:54:04,362 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 19:54:04,367 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 19:54:04,490 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 19:54:04,494 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 19:54:06,576 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:54:06,576 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 19:54:06,587 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 19:54:06,728 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:54:06,728 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 19:54:06,735 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 19:54:06,839 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:54:06,839 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 19:54:06,847 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 19:54:06,875 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 15 treesize of output 7 [2022-12-13 19:54:06,877 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 19:54:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:54:06,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:54:07,136 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 19:54:07,169 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-12-13 19:54:07,239 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7832))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7833) .cse0 v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7833) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-12-13 19:54:09,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7927))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7926) .cse1 v_ArrVal_7833) (select (select (store .cse2 .cse1 v_ArrVal_7832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7834))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7927))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7832))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7926) .cse4 v_ArrVal_7833) .cse5 v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-12-13 19:54:09,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:54:09,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987238529] [2022-12-13 19:54:09,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987238529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:54:09,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1033706178] [2022-12-13 19:54:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:09,693 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:54:09,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:54:09,694 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:54:09,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-12-13 19:56:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:56:06,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-12-13 19:56:06,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:56:06,658 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 19:56:07,073 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 19:56:07,109 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:56:07,110 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 19:56:07,213 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 19:56:07,223 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 19:56:07,513 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 19:56:07,518 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 19:56:11,060 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:56:11,060 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 19:56:11,069 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 19:56:11,401 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:56:11,401 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 19:56:11,419 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 19:56:11,626 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:56:11,626 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 19:56:11,635 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 19:56:11,678 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 19:56:11,683 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 19:56:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:56:11,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:56:11,773 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 19:56:11,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-13 19:56:11,946 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8428) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8429))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8428) .cse2 v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 19:56:12,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8429))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8428) .cse1 v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8428) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2022-12-13 19:56:13,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8522))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8429))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8523) .cse0 v_ArrVal_8428) .cse1 v_ArrVal_8431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8522))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8523) .cse6 v_ArrVal_8428) (select (select (store .cse7 .cse6 v_ArrVal_8429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8431))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-12-13 19:56:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1033706178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:56:13,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:56:13,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-12-13 19:56:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495424958] [2022-12-13 19:56:13,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:56:13,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 19:56:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:56:13,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 19:56:13,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=593, Unknown=40, NotChecked=522, Total=1260 [2022-12-13 19:56:13,253 INFO L87 Difference]: Start difference. First operand 1789 states and 2441 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 20 states have internal predecessors, (159), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:56:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:56:56,956 INFO L93 Difference]: Finished difference Result 2908 states and 3915 transitions. [2022-12-13 19:56:56,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 19:56:56,957 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 20 states have internal predecessors, (159), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 138 [2022-12-13 19:56:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:56:56,960 INFO L225 Difference]: With dead ends: 2908 [2022-12-13 19:56:56,960 INFO L226 Difference]: Without dead ends: 2908 [2022-12-13 19:56:56,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 172 SyntacticMatches, 89 SemanticMatches, 46 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=202, Invalid=1261, Unknown=55, NotChecked=738, Total=2256 [2022-12-13 19:56:56,960 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 2507 mSDsluCounter, 6940 mSDsCounter, 0 mSdLazyCounter, 12881 mSolverCounterSat, 33 mSolverCounterUnsat, 762 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2512 SdHoareTripleChecker+Valid, 7729 SdHoareTripleChecker+Invalid, 13676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12881 IncrementalHoareTripleChecker+Invalid, 762 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:56:56,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2512 Valid, 7729 Invalid, 13676 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 12881 Invalid, 762 Unknown, 0 Unchecked, 42.2s Time] [2022-12-13 19:56:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-12-13 19:56:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1788. [2022-12-13 19:56:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1345 states have (on average 1.7695167286245352) internal successors, (2380), 1751 states have internal predecessors, (2380), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:56:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2439 transitions. [2022-12-13 19:56:56,978 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2439 transitions. Word has length 138 [2022-12-13 19:56:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:56:56,978 INFO L495 AbstractCegarLoop]: Abstraction has 1788 states and 2439 transitions. [2022-12-13 19:56:56,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 20 states have internal predecessors, (159), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:56:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2439 transitions. [2022-12-13 19:56:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 19:56:56,979 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:56:56,979 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, 1, 1, 1, 1, 1, 1, 1, 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 19:56:57,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2022-12-13 19:56:57,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (37)] Ended with exit code 0 [2022-12-13 19:56:57,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:56:57,381 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:56:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:56:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576451, now seen corresponding path program 1 times [2022-12-13 19:56:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:56:57,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480683659] [2022-12-13 19:56:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:56:57,385 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 19:56:57,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:56:57,386 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:56:57,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (39)] Waiting until timeout for monitored process [2022-12-13 19:56:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:56:58,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 19:56:58,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:56:58,572 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 19:56:58,920 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:56:58,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:56:58,981 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 19:56:59,173 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 24 treesize of output 12 [2022-12-13 19:57:02,999 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:02,999 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 36 treesize of output 37 [2022-12-13 19:57:03,232 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:03,232 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 36 treesize of output 37 [2022-12-13 19:57:03,414 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:03,414 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 36 treesize of output 37 [2022-12-13 19:57:03,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:03,604 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 36 treesize of output 37 [2022-12-13 19:57:03,640 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 33 treesize of output 15 [2022-12-13 19:57:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:57:03,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:57:06,035 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 19:57:06,063 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8994))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:57:06,085 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8994))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 19:57:06,119 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8993))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-13 19:57:06,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8993))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 19:57:06,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9041))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8993)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:57:06,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:57:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480683659] [2022-12-13 19:57:06,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480683659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:57:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2138666097] [2022-12-13 19:57:06,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:06,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:57:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:57:06,607 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:57:06,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-12-13 19:57:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:14,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-13 19:57:14,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:57:14,868 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 19:57:15,187 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:57:15,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:57:15,212 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 19:57:15,320 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 24 treesize of output 12 [2022-12-13 19:57:19,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:19,055 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 36 treesize of output 37 [2022-12-13 19:57:19,209 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:19,209 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 36 treesize of output 37 [2022-12-13 19:57:19,314 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:19,314 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 36 treesize of output 37 [2022-12-13 19:57:19,410 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:19,410 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 36 treesize of output 37 [2022-12-13 19:57:19,457 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 33 treesize of output 15 [2022-12-13 19:57:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-13 19:57:19,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:57:19,510 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_9513) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:57:19,530 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 19:57:19,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9512))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9513)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 19:57:19,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9512))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9513)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 19:57:19,618 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9511))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9513)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-13 19:57:19,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9511))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9513)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 19:57:20,173 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9559))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9511)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9513)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 19:57:20,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2138666097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:57:20,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:57:20,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2022-12-13 19:57:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644880647] [2022-12-13 19:57:20,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:57:20,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 19:57:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:57:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 19:57:20,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=319, Unknown=31, NotChecked=624, Total=1056 [2022-12-13 19:57:20,181 INFO L87 Difference]: Start difference. First operand 1788 states and 2439 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:57:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:57:44,654 INFO L93 Difference]: Finished difference Result 2260 states and 3039 transitions. [2022-12-13 19:57:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 19:57:44,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 141 [2022-12-13 19:57:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:57:44,657 INFO L225 Difference]: With dead ends: 2260 [2022-12-13 19:57:44,657 INFO L226 Difference]: Without dead ends: 2260 [2022-12-13 19:57:44,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 187 SyntacticMatches, 89 SemanticMatches, 44 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=179, Invalid=884, Unknown=45, NotChecked=962, Total=2070 [2022-12-13 19:57:44,659 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 1646 mSDsluCounter, 4264 mSDsCounter, 0 mSdLazyCounter, 5171 mSolverCounterSat, 33 mSolverCounterUnsat, 842 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 4762 SdHoareTripleChecker+Invalid, 6046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 5171 IncrementalHoareTripleChecker+Invalid, 842 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:57:44,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 4762 Invalid, 6046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 5171 Invalid, 842 Unknown, 0 Unchecked, 23.3s Time] [2022-12-13 19:57:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2022-12-13 19:57:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1787. [2022-12-13 19:57:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1345 states have (on average 1.7680297397769518) internal successors, (2378), 1750 states have internal predecessors, (2378), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-12-13 19:57:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2437 transitions. [2022-12-13 19:57:44,676 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2437 transitions. Word has length 141 [2022-12-13 19:57:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:57:44,676 INFO L495 AbstractCegarLoop]: Abstraction has 1787 states and 2437 transitions. [2022-12-13 19:57:44,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:57:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2437 transitions. [2022-12-13 19:57:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 19:57:44,677 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:57:44,677 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, 1, 1, 1, 1, 1, 1, 1, 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 19:57:44,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (39)] Forceful destruction successful, exit code 0 [2022-12-13 19:57:44,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-12-13 19:57:45,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:57:45,078 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-12-13 19:57:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576452, now seen corresponding path program 1 times [2022-12-13 19:57:45,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:57:45,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282415122] [2022-12-13 19:57:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:45,082 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 19:57:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:57:45,083 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 19:57:45,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/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 (41)] Waiting until timeout for monitored process [2022-12-13 19:57:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:46,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 127 conjunts are in the unsatisfiable core [2022-12-13 19:57:46,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:57:46,364 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 19:57:46,733 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 19:57:46,801 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:57:46,801 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 19:57:46,857 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 19:57:46,875 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 19:57:47,093 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 19:57:47,102 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 19:57:50,970 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10073))) (exists ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10074))) (exists ((v_arrayElimCell_134 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_134) (_ bv44 32)))) is different from true [2022-12-13 19:57:51,048 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:51,048 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 19:57:51,069 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 19:57:51,290 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:51,290 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 19:57:51,309 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 19:57:51,484 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:51,484 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 19:57:51,500 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 19:57:51,693 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:57:51,694 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 19:57:51,713 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 19:57:51,747 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 19:57:51,754 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 19:57:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 19:57:51,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:57:52,158 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10080 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 19:57:52,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10080 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2022-12-13 19:57:52,356 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10078))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10077) .cse0 v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10077) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2022-12-13 19:57:52,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10077) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10078))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10077) .cse3 v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-12-13 19:57:54,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10075))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10078))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10076) .cse0 v_ArrVal_10077) .cse1 v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10075))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10076) .cse6 v_ArrVal_10077) (select (select (store .cse7 .cse6 v_ArrVal_10078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10079))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2022-12-13 19:57:55,840 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10075))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10076) .cse2 v_ArrVal_10077) (select (select (store .cse3 .cse2 v_ArrVal_10078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10079))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10075))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10078))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10076) .cse5 v_ArrVal_10077) .cse6 v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2022-12-13 19:57:59,455 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10172))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10075))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10171) .cse1 v_ArrVal_10076) .cse2 v_ArrVal_10077) (select (select (store .cse3 .cse2 v_ArrVal_10078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10079))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10172))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10075))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10078))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10171) .cse6 v_ArrVal_10076) .cse7 v_ArrVal_10077) .cse8 v_ArrVal_10079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2022-12-13 19:57:59,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:57:59,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282415122] [2022-12-13 19:57:59,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282415122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:57:59,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [660564441] [2022-12-13 19:57:59,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:59,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:57:59,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:57:59,487 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:57:59,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e50a8d59-9e39-4c97-b8d2-2ac7ed2806de/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-12-13 20:01:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:16,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 127 conjunts are in the unsatisfiable core [2022-12-13 20:01:16,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:01:16,127 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 20:01:17,086 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 20:01:17,234 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 20:01:17,234 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 20:01:17,302 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 20:01:17,355 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 20:01:17,578 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 20:01:17,593 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 20:01:27,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10687 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10687))) (exists ((v_ArrVal_10686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10686) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_134 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_134) (_ bv44 32)))) is different from true [2022-12-13 20:01:28,107 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:01:28,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 20:01:28,152 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 20:01:28,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:01:28,441 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 20:01:28,488 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 20:01:28,697 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:01:28,697 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 20:01:28,738 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 20:01:28,925 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:01:28,925 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 20:01:28,955 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 20:01:29,042 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 20:01:29,057 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 20:01:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 20:01:29,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:01:29,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2022-12-13 20:01:29,325 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2022-12-13 20:01:29,445 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10690))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10691) .cse0 v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10691) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2022-12-13 20:01:29,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10690))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10691) .cse1 v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10691) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2022-12-13 20:01:29,926 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10689))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10690))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10688) .cse0 v_ArrVal_10691) .cse1 v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10689))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10688) .cse6 v_ArrVal_10691) (select (select (store .cse7 .cse6 v_ArrVal_10690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10693))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2022-12-13 20:01:30,258 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_10692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10689))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10690))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10688) .cse1 v_ArrVal_10691) .cse2 v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10689))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10688) .cse7 v_ArrVal_10691) (select (select (store .cse8 .cse7 v_ArrVal_10690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10693))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2022-12-13 20:01:34,809 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10785))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10689))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10784) .cse1 v_ArrVal_10688) .cse2 v_ArrVal_10691) (select (select (store .cse3 .cse2 v_ArrVal_10690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10693))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10785))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10689))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10690))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10784) .cse6 v_ArrVal_10688) .cse7 v_ArrVal_10691) .cse8 v_ArrVal_10693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2022-12-13 20:01:34,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [660564441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:01:34,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:01:34,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2022-12-13 20:01:34,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811383627] [2022-12-13 20:01:34,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:01:34,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 20:01:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:01:34,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 20:01:34,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=310, Unknown=17, NotChecked=784, Total=1190 [2022-12-13 20:01:34,845 INFO L87 Difference]: Start difference. First operand 1787 states and 2437 transitions. Second operand has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 16 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)